Related papers: Redheffer: Trig to Quantum Error Bounds
We describe a quantum perturbative approach to evaluating the phase shift of an atom interferometer in a weakly anharmonic trap. This provides a simple way to evaluate quantum corrections to the standard semi-classical approximation. The…
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…
Quantum Phase Estimation is a crucial component of several front-running quantum algorithms. Improving the efficiency and accuracy of QPE is currently a very active field of research. In this work, we present a hybrid quantum-classical…
An efficient quantum modular exponentiation method is indispensible for Shor's factoring algorithm. But we find that all descriptions presented by Shor, Nielsen and Chuang, Markov and Saeedi, et al., are flawed. We also remark that some…
The method of using rearrangements to give sufficient conditions for Fourier inequalities between weighted Lebesgue spaces is revisited. New results in the case q < p are established and a comparison between two known sufficient conditions…
This work compares the overhead of quantum error correction with concatenated and topological quantum error-correcting codes. To perform a numerical analysis, we use the Quantum Resource Estimator Toolbox (QuRE) that we recently developed.…
We present a generalization of quantum error correction to infinite-dimensional Hilbert spaces. The generalization yields new classes of quantum error correcting codes that have no finite-dimensional counterparts. The error correction…
We establish a lower bound on the quantum coherence of an arbitrary quantum state in arbitrary dimension, using a noncommutativity estimator of an arbitrary observable of sub-unit norm, where the estimator is the commutator of the…
Quantum coherence, a basic feature of quantum mechanics residing in superpositions of quantum states, is a resource for quantum information processing. Coherence emerges in a fundamentally different way for nonidentical and identical…
Violation of modified Wigner inequality by means binary bipartite quantum system allows the discrimination between the quantum world and the classical local-realistic one, and also ensures the security of Ekert-like quantum key distribution…
We present a quantum error correcting code that is invariant under the conditional time evolution between spontaneous emissions and which can correct for one general error. The code presented here generalizes previous error correction codes…
Due to its significance as a subroutine, in this work, we consider the coherent version of the quantum phase estimation problem, where given an arbitrary input state and black-box access to unitaries $U$ and controlled-$U$, the goal is to…
In many quantum information applications, a minimum detection efficiency must be exceeded to ensure success. Protocols depending on the violation of a Bell inequality, for instance, may be subject to the so-called detection loophole:…
A group theoretic framework is introduced that simplifies the description of known quantum error-correcting codes and greatly facilitates the construction of new examples. Codes are given which map 3 qubits to 8 qubits correcting 1 error, 4…
Topological quantum error correction codes are currently among the most promising candidates for efficiently dealing with the decoherence effects inherently present in quantum devices. Numerically, their theoretical error threshold can be…
We show that the probability distribution of the error exponent in i.i.d. code ensembles over classical-quantum (CQ) channels with arbitrary output states accumulates above a threshold that is strictly larger than the CQ random coding…
Leggett-Garg's inequalities predict sharp bounds for some classical correlation functions that address the quantum or classical nature of real-time evolutions. We experimentally observe the violations of these bounds on single- and…
Quantum phase estimation is a core task in quantum technologies ranging from metrology to quantum computing, where it appears as a key subroutine in various algorithms. Here, we quantitatively connect the performance of phase estimation…
We present a quantum algorithm to solve systems of linear equations of the form $A\mathbf{x}=\mathbf{b}$, where $A$ is a tridiagonal Toeplitz matrix and $\mathbf{b}$ results from discretizing an analytic function, with a circuit complexity…
Coherent superpositions are one of the hallmarks of quantum mechanics and are vital for any quantum mechanical device to outperform the classically achievable. Generically, superpositions are verified in interference experiments, but…