Related papers: Can quantum chaos enhance stability of quantum com…
The discovery of quantum error correction has greatly improved the long-term prospects for quantum computing technology. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the…
Quantum coherences are paramount resources for applications, such as quantum-enhanced light-harvesting or quantum computing, which are fragile against environmental noise. We here derive generalized quantum master equations using…
While there is strong evidence for advantages of quantum over classical computation, the repertoire of computational primitives with proven or conjectured quantum advantage remains limited. A big challenge of quantum algorithmic design is a…
The implementation of quantum gates with fidelities that exceed the threshold for reliable quantum computing requires robust gates whose performance is not limited by the precision of the available control fields. The performance of these…
Certain physical aspects of quantum error correction are discussed for a quantum computer (n-qubit register) in contact with a decohering environment. Under rather plausible assumptions upon the form of the computer-environment interaction,…
An enduring challenge in computer science is reducing the runtime required to solve computational problems. Quantum computing has attracted significant attention due to its potential to deliver asymptotically faster solutions to certain…
We explore the effect of a system's symmetries on fidelity decay behavior. Chaos-like exponential fidelity decay behavior occurs in non-chaotic systems when the system possesses symmetries and the applied perturbation is not tied to a…
We characterize the quantum gate fidelity in a state-independent manner by giving an explicit expression for its variance. The method we provide can be extended to calculate all higher order moments of the gate fidelity. Using these results…
Errors occurring on noisy hardware pose a key challenge to reliable quantum computing. Existing techniques such as error correction, mitigation, or suppression typically separate the error handling from the algorithm analysis and design. In…
A leading approach to algorithm design aims to minimize the number of operations in an algorithm's compilation. One intuitively expects that reducing the number of operations may decrease the chance of errors. This paradigm is particularly…
Reliable processing of quantum information for developing quantum technologies requires precise control of out-of-equilibrium many-bodysystems. This is a highly challenging task as the fragility of quantum states to external perturbations…
Quantum advantage requires overcoming noise-induced degradation of quantum systems. Conventional methods for reducing noise such as error mitigation face scalability issues in deep circuits. Specifically, noise hampers the extraction of…
In quantum computing, the nonstabilizerness of quantum operations is crucial for understanding and quantifying quantum speedups. In this study, we explore the phenomena of nonstabilizerness of the quantum SWITCH, a novel structure that…
The speed-up provided by quantum algorithms with respect to their classical counterparts is at the origin of scientific interest in quantum computation. However, the fundamental reasons for such a speed-up are not yet completely understood…
In this paper, we show how to use low-fidelity operations to control the dynamics of quantum systems. Noisy operations usually drive a system to evolve into a mixed state and damage the coherence. Sometimes frequent noisy operations result…
We show that the recently introduced operator fidelity metric provides a natural tool to investigate the cross-over to quantum chaotic behaviour. This metric is an information-theoretic measure of the global stability of a unitary evolution…
Noise mechanisms in quantum systems can be broadly characterized as either coherent (i.e., unitary) or incoherent. For a given fixed average error rate, coherent noise mechanisms will generally lead to a larger worst-case error than…
We analyse the resilience of the quantum search algorithm in the presence of quantum noise modelled as trace preserving completely positive maps. We study the influence of noise on computational complexity of the quantum search algorithm.…
The Quantum Computer Condition (QCC) provides a rigorous and completely general framework for carrying out analyses of questions pertaining to fault-tolerance in quantum computers. In this paper we apply the QCC to the problem of…
We derive a simple and general relation between the fidelity of quantum motion, characterizing the stability of quantum dynamics with respect to arbitrary static perturbation of the unitary evolution propagator, and the integrated time…