Jaroslaw Miszczak

Dr. Jaroslaw Miszczak

Institute of Theoretical and Applied Informatics, Gliwice, Śląskie, Poland
orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2017 in Bulletin Of The Polish Academy Of Sciences-Technical Sciences
Verified
Journal Article
Open access
PDF file
ZPZ. Puchała
Z. Puchała
Jaroslaw MiszczakJaroslaw Miszczak
Jaroslaw Miszczak
We present IntU package for Mathematica computer algebra system. The presented package performs a symbolic integration of polynomial functions over the unitary group with respect to unique normalized Haar measure. We describe a number of special cases which can be used to optimize the calculation speed for some classes of integrals. We also provide some examples of usage of the presented package.

1 January 2009 in Quantum Information & Computation
Verified
Journal Article
Closed access
Jaroslaw MiszczakJaroslaw Miszczak
Jaroslaw Miszczak
ZPZ. Puchala
Z. Puchala
PHP. Horodecki
P. Horodecki
AUA. Uhlmann
A. Uhlmann
KZK. Zyczkowski
K. Zyczkowski
We derive several bounds on fidelity between quantum states. In particular we show that fidelity is bounded from above by a simple to compute quantity we call super--fidelity. It is analogous to another quantity called sub--fidelity. For any two states of a two--dimensional quantum system (N=2) all three quantities coincide. We demonstrate that sub-- and super--fidelity are concave functions. We also show that super--fidelity is super--multiplicative while sub--fidelity is sub--multiplicative and design feasible schemes to measure these quantities in an experiment.Super--fidelity can be used to define a distance between quantum states. With respect to this metric the set of quantum states forms a part of a N^2-1 dimensional hypersphere.

28 February 2022 in Physical Review A
Verified
Journal Article
Closed access
PDF file
LBLudmila Botelho
Ludmila Botelho
AGAdam Glos
Adam Glos
Akash KunduAkash Kundu
Akash Kundu
Jaroslaw MiszczakJaroslaw Miszczak
Jaroslaw Miszczak
ÖSÖzlem Salehi
Özlem Salehi
ZZZoltán Zimborás
Zoltán Zimborás
Noisy intermediate-scale quantum algorithms require novel paradigms of error mitigation. To obtain noise-robust quantum computers, each logical qubit is equipped with hundreds or thousands of physical qubits. However, it is not possible to use memory-consuming techniques for current quantum devices having at most hundreds or thousands of physical qubits on their own. For specific problems, valid quantum states have a unique structure as in the case of Fock states and W states where the Hamming weight is fixed, and the evolution takes place in a smaller subspace of the full Hilbert space. With this preknowledge, some errors can be detected during the evolution of the circuit, by filtering the states not obeying the pattern through postselection. In this paper, we present mid-circuit postselection schemes for frequently used encodings such as one-hot, binary, gray, and domain-wall encoding. For the particular subspace of one-hot states, we propose a method that works by compressing the full Hilbert space to a smaller subspace, allowing projecting to the desired subspace without using any ancilla qubits. We demonstrate the effectiveness of the approach for the quantum alternating operator ansatz algorithm. Our method is particularly suitable for the currently available hardware, where measuring and resetting are possible, but classical conditional operators are not.

22 January 2022 in Quantum Information Processing
Verified
Journal Article
Open access
PDF file
ÖSÖzlem Salehi
Özlem Salehi
AGAdam Glos
Adam Glos
Jaroslaw MiszczakJaroslaw Miszczak
Jaroslaw Miszczak
Quantum computing is offering a novel perspective for solving combinatorial optimization problems. To fully explore the possibilities offered by quantum computers, the problems need to be formulated as unconstrained binary models, taking into account limitation and advantages of quantum devices. In this work, we provide a detailed analysis of the travelling salesman problem with time windows (TSPTW) in the context of solving it on a quantum computer. We introduce quadratic unconstrained binary optimization and higher-order binary optimization formulations of this problem. We demonstrate the advantages of edge-based and node-based formulations of the TSPTW problem. Additionally, we investigate the experimental realization of the presented methods on a quantum annealing device. The provided results pave the path for utilizing quantum computer for a variety of real-world tasks which can be cast in the form of travelling salesman problem with time windows.

1 September 2011 in International Journal of Modern Physics C
Verified
Journal Article
Closed access
Jaroslaw MiszczakJaroslaw Miszczak
Jaroslaw Miszczak

16 April 2008 in Physical Review A
Verified
Journal Article
Closed access
PDF file
DMDamian Markham
Damian Markham
Jaroslaw MiszczakJaroslaw Miszczak
Jaroslaw Miszczak
ZPZbigniew Puchała
Zbigniew Puchała
KŻKarol Życzkowski
Karol Życzkowski
We analyze the problem of finding sets of quantum states that can be deterministically discriminated. From a geometric point of view, this problem is equivalent to that of embedding a simplex of points whose distances are maximal with respect to the Bures distance (or trace distance). We derive upper and lower bounds for the trace distance and for the fidelity between two quantum states, which imply bounds for the Bures distance between the unitary orbits of both states. We thus show that, when analyzing minimal and maximal distances between states of fixed spectra, it is sufficient to consider diagonal states only. Hence when optimal discrimination is considered, given freedom up to unitary orbits, it is sufficient to consider diagonal states. This is illustrated geometrically in terms of Weyl chambers.