Related papers: Efficient algorithm for fidelity estimation of two…
The optimal quantum control theory is employed to determine electric pulses capable of producing quantum gates with high fidelity (higher than 0.9997). Particularly, these quantum gates were chosen to perform the permutation algorithm (Z.…
We study efficient quantum certification algorithms for quantum state set and unitary quantum channel. We present an algorithm that uses $O(\varepsilon^{-4}\ln |\mathcal{P}|)$ copies of an unknown state to distinguish whether the unknown…
Fidelity and relative entropy are two significant quantities in quantum information theory. We study the quantum fidelity and relative entropy under unitary orbits. The maximal and minimal quantum fidelity and relative entropy between two…
Characterizing entanglement in all but the simplest case of a two qubit pure state is a hard problem, even understanding the relevant experimental quantities that are related to entanglement is difficult. It may not be necessary, however,…
The quantum state discrimination problem is to distinguish between non-orthogonal quantum states. This problem has many applications in quantum information theory, quantum communication and quantum cryptography. In this paper a quantum…
Quantum phase estimation is one of the key algorithms in the field of quantum computing, but up until now, only approximate expressions have been derived for the probability of error. We revisit these derivations, and find that by ensuring…
The leading approach to fault tolerant quantum computing requires a continual supply of magic states. When a new magic state is first encoded, its initial fidelity will be too poor for use in the computation. This necessitates a…
It is shown that the fidelity, a basic notion of quantum information science, may be used to characterize quantum phase transitions, regardless of what type of internal order is present in quantum many-body states. If the fidelity of two…
A method of representing probabilistic aspects of quantum systems is introduced by means of a density function on the space of pure quantum states. In particular, a maximum entropy argument allows us to obtain a natural density function…
The computational power of real-world quantum computers is limited by errors. When using quantum computers to perform algorithms which cannot be efficiently simulated classically, it is important to quantify the accuracy with which the…
We theoretically evaluate establishing remote entanglement between distinguishable matter qubits through interference and detection of two emitted photons. The fidelity of the entanglement operation is analyzed as a function of the temporal…
We present a novel algorithm to compute the density of states, which is proven to converge to the correct result. The algorithm is very general and can be applied to a wide range of models, in the frameworks of Statistical Mechanics and…
Present-day quantum devices require precise implementation of desired quantum channels. To characterize the quality of implementation one uses the average operation fidelity $F$, defined as the fidelity between an initial pure state and its…
We propose a quantum tomography scheme for pure qudit systems which adopts random base measurements and generative learning methods, along with a built-in fidelity estimation approach to assess the reliability of the tomographic states. We…
Mapping the system evolution of a two-state system allows the determination of the effective system Hamiltonian directly. We show how this can be achieved even if the system is decohering appreciably over the observation time. A method to…
Quantum state tomography, the ability to deduce the state of a quantum system from measured data, is the gold standard for verification and benchmarking of quantum devices. It has been realized in systems with few components, but for larger…
Quantum state tomography (QST) is plagued by the ``curse of dimensionality'' due to the exponentially-scaled complexity in measurement and data post-processing. Efficient QST schemes for large-scale mixed states are currently missing. In…
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…
The possibility of masking an accelerated two-qubit system by using a minimum number of qubits is discussed. It is shown that, the information may be masked in either entangled local states or product non-local separable states. We examine…
In this paper we consider feedback control algorithms for the rapid purification of a bipartite state consisting of two qubits, when the observer has access to only one of the qubits. We show 1) that the algorithm that maximizes the average…