Related papers: Effects of decoherence and imperfections for quant…
Given a parameterized quantum circuit such that a certain setting of these real-valued parameters corresponds to Grover's celebrated search algorithm, can a variational algorithm recover these settings and hence learn Grover's algorithm? We…
We discuss effects of loss of coherence in low energy quantum systems caused by or related to gravitation, referred to as gravitational decoherence. These effects, resulting from random metric fluctuations, for instance, promise to be…
The standard generic quantum computer model is studied analytically and numerically and the border for emergence of quantum chaos, induced by imperfections and residual inter-qubit couplings, is determined. This phenomenon appears in an…
Coherent control errors, for which ideal Hamiltonians are perturbed by unknown multiplicative noise terms, are a major obstacle for reliable quantum computing. In this paper, we present a framework for analyzing the robustness of quantum…
The theory of decoherent histories is an attempt to derive classical physics from positing only quantum laws at the fundamental level without notions of a classical apparatus or collapse of the wave-function. Searching for a marked target…
The external control circuits of quantum gates inevitably introduce a small but finite noise to the operation of quantum computers. The complex modes of decoherence introduced by this noise are not covered by the common error models. Using…
We examine how amplitude noise in queries to the oracle degrades a performance of quantum search algorithm. The Grover search and similar techniques are widely used in various quantum algorithms, including cases where rival parties are…
Grover's search algorithm is one of the first quantum algorithms to exhibit a provable quantum advantage. It forms the backbone of numerous quantum applications and is widely used in benchmarking efforts. Here, we report…
Entanglement lies at the heart of quantum mechanics and has no classical analogue. It is central to the speed up achieved by quantum algorithms over their classical counterparts. The Grover's search algorithm is one such algorithm which…
Experimentalists seeking to improve the coherent lifetimes of quantum bits have generally focused on mitigating decoherence mechanisms through, for example, improvements to qubit designs and materials, and system isolation from…
Geometric phase is a promising element to induce high-fidelity and robust quantum operations due to its built-in noise-resilience feature. Unfortunately, its practical applications are usually circumscribed by requiring complex interactions…
Grover's algorithm is a primary algorithm offered as evidence that quantum computers can provide an advantage over classical computers. It involves an "oracle" specified for a given application whose structure is not part of the formal…
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,…
Quantum advantage is the core of quantum computing. Grover's search algorithm is the only quantum algorithm with proven advantage to any possible classical search algorithm. However, realizing this quantum advantage in practice is quite…
Quantum computers herald the arrival of a new era in which previously intractable computational problems will be solved efficiently. However, quantum technology is held down by decoherence, a phenomenon that is omnipresent in the quantum…
Quantum Algorithms have long captured the imagination of computer scientists and physicists primarily because of the speed up achieved by them over their classical counterparts using principles of quantum mechanics. Entanglement is believed…
Minimizing the effect of decoherence on a quantum register must be a central part of any strategy to realize scalable quantum information processing. Apart from the strength of the coupling to the environment, the decoherence rate is…
A system of quantum computing structures is introduced and proven capable of making emerge, on average, the orbits of classical bounded nonlinear maps on \mathbb{C} through the iterative action of path-dependent quantum gates. The effects…
We study analytically and numerically the effects of various imperfections in a quantum computation of a simple dynamical model based on the Quantum Wavelet Transform (QWT). The results for fidelity timescales, obtained for a large range of…
The quite different behaviors exhibited by microscopic and macroscopic systems with respect to quantum interferences suggest the existence of a borderline beyond which quantum systems loose their coherences and can be described classically.…