Related papers: Decoherence in adiabatic quantum computation
Geometric phases depend only on the evolution path determined by the closed circuit in the projective Hilbert space but not on evolution details of the quantum system, leading to geometric quantum computation possessing some intrinsic…
Geometric phase has the intrinsic property of being resistant to some types of local noises as it only depends on global properties of the evolution path. Meanwhile, the non-Abelian geometric phase is in the matrix form, and thus can…
We present a study of the effects of decoherence in the operation of a discrete quantum walk on a line, cycle and hypercube. We find high sensitivity to decoherence, increasing with the number of steps in the walk, as the particle is…
In order to understand quantum decoherence of a quantum system due to its interaction with a large system behaving classically, we introduce the concept of adiabatic quantum entanglement based on the Born-Oppenhemeir approximation. In the…
Two recent preprints [B. Altshuler, H. Krovi, and J. Roland, "Quantum adiabatic optimization fails for random instances of NP-complete problems", arXiv:0908.2782 and "Anderson localization casts clouds over adiabatic quantum optimization",…
We study the effects of amplitude and phase damping decoherence in d-dimensional one-way quantum computation (QC). Our investigation shows how information transfer and entangling gate simulations are affected for d>=2. To understand…
We describe the decoherence process induced on a two-level quantum system in direct interaction with a non-equilibrium environment. The non-equilibrium feature is represented by a non-stationary random function corresponding to the…
We present an extension of Adiabatic Quantum Computing (AQC) algorithm for the unstructured search to the case when the number of marked items is unknown. The algorithm maintains the optimal Grover speedup and includes a small counting…
The training of neural networks (NNs) is a computationally intensive task requiring significant time and resources. This paper presents a novel approach to NN training using Adiabatic Quantum Computing (AQC), a paradigm that leverages the…
We show that, during adiabatic evolution, any changes in entanglement can be attributed to a succession of avoided energy level crossings at which eigenvalues swap their eigenvectors. These swaps mediate the generation and redistribution of…
The ion trap quantum computer proposed by Cirac and Zoller is analyzed for decoherence due to vibrations of the ions. An adiabatic approximation exploiting the vast difference between the frequencies of the optical intraionic transition and…
The accelerated progress in manufacturing noisy intermediate-scale quantum (NISQ) computing hardware has opened the possibility of exploring its application in transforming approaches to solving computationally challenging problems. The…
We show that quantum computation can be performed in a system at thermal equilibrium if a spontaneous symmetry breaking occurs. The computing process is associated to the time evolution of the statistical average of the qubit coherence…
Quantum annealing (QA) is one of the efficient methods to calculate the ground-state energy of a problem Hamiltonian. In the absence of noise, QA can accurately estimate the ground-state energy if the adiabatic condition is satisfied.…
We propose a method for controlling the decoherence of a driven qubit that is strongly coupled to a reservoir, when the qubit resonance frequency is close to a continuum edge of the reservoir spectum. This strong-coupling regime is outside…
Real quantum systems couple to their environment and lose their intrinsic quantum nature through the process known as decoherence. Here we present a method for minimizing decoherence by making it energetically unfavorable. We present a…
We present an introduction to coined quantum walks on regular graphs, which have been developed in the past few years as an alternative to quantum Fourier transforms for underpinning algorithms for quantum computation. We then describe our…
Adiabatic limit is the presumption of the adiabatic geometric quantum computation and of the adiabatic quantum algorithm. But in reality, the variation speed of the Hamiltonian is finite. Here we develop a general formulation of adiabatic…
We elucidate the geometry of quantum adiabatic evolution. By minimizing the deviation from adiabaticity we find a Riemannian metric tensor underlying adiabatic evolution. Equipped with this tensor, we identify a unified geometric…
We consider decoherence of quantum registers, which consist of the qubits sited approximately periodically in space. The sites of the qubits are permitted to have a small random variance. We derive the explicit conditions under which the…