Related papers: Noise enhanced performance of adiabatic quantum co…
Geometric phases are an interesting resource for quantum computation, also in view of their robustness against decoherence effects. We study here the effects of the environment on a class of one-qubit holonomic gates that have been recently…
Analog models of quantum information processing, such as adiabatic quantum computation and analog quantum simulation, require the ability to subject a system to precisely specified Hamiltonians. Unfortunately, the hardware used to implement…
We provide a unified geometrical description for analyzing the stability of holonomic quantum gates in the presence of imprecise driving controls (parametric noise). We consider the situation in which these fluctuations do not affect the…
Adiabatic quantum algorithms solve computational problems by slowly evolving a trivial state to the desired solution. On an ideal quantum computer, the solution quality improves monotonically with increasing circuit depth. By contrast,…
Adiabatic Quantum Computing relies on the quantum adiabatic theorem, which states that a quantum system evolves along its ground state with time if the governing Hamiltonian varies infinitely slowly. However, practical limitations force…
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum…
Scaling up quantum computing hardware is hindered by the narrow operating margins of current quantum components. Here, we introduce a composite qubit and gate scheme that achieves wide margins by use of transistor-like nonlinearities to…
It has recently been shown that there are efficient algorithms for quantum computers to solve certain problems, such as prime factorization, which are intractable to date on classical computers. The chances for practical implementation,…
We introduce the non-adiabatic, or Aharonov-Anandan, geometric phase as a tool for quantum computation and show how it could be implemented with superconducting charge qubits. While it may circumvent many of the drawbacks related to the…
In the quantum-computation scenario, geometric phase-gates are becoming increasingly attractive for their intrinsic fault tolerance to disturbance. With an adiabatic cyclic evolution, Berry phase appears to realize a geometric…
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on $n$-bits in time $\text{poly}(n) 2^{n/2}$. In this work, we investigate whether such general…
We present a numerical study of the robustness of a specific class of non-abelian holonomic quantum gates . We take into account the parametric noise due to stochastic fluctuations of the control fields which drive the time-dependent…
The biggest challenge that quantum computing and quantum machine learning are currently facing is the presence of noise in quantum devices. As a result, big efforts have been put into correcting or mitigating the induced errors. But, can…
We examine the realization of a quantum CNOT gate by adiabatic operations.The principles of such systems and their analysis are briefly discussed and a model consisting of two weakly coupled double- potential well qubits is studied…
Advancing quantum technologies necessitates an in-depth exploration of how operations generate quantum resources and respond to noise. Crucial are gates generating quantum coherence and the challenge of mitigating gate dephasing noise.…
We study entanglement degradation of two non-interacting qubits subject to independent baths with broadband spectra typical of solid state nanodevices. We obtain the analytic form of the concurrence in the presence of adiabatic noise for…
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…
We provide rigorous bounds for the error of the adiabatic approximation of quantum mechanics under four sources of experimental error: perturbations in the initial condition, systematic time-dependent perturbations in the Hamiltonian,…
Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions -- typically associated with broken or restored symmetries -- should be advantageous in comparison to…
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…