Related papers: Decoherence in adiabatic quantum computation
The coupling of a mesoscopic system with its environment usually causes total decoherence: at long times the reduced density matrix of the system evolves in time to a limit which is independent of its initial value, losing all the quantum…
Based on the adiabatic geometric phase concerning with density matrix[1] , we extend it to the sub-geometric phase in the non-adiabatic case. It is found that whatever the real part or imaginary part of the sub-geometric phase can play an…
We study a quantum repeater which is based on decoherence free quantum gates recently proposed by Klein et al. [Phys. Rev. A 73, 012332 (2006)]. A number of operations on the decoherence free subspace in this scheme makes use of an ancilla…
Adiabatic quantum computation (AQC), which is particularly useful for combinatorial optimization, becomes more powerful by using excited states, instead of ground states. However, the excited-state AQC is prone to errors due to dissipation.…
The quantum speed limit specifies a universal bound of the fidelity between the initial state and the time-evolved state. We apply this method to find a bound of the fidelity between the adiabatic state and the time-evolved state. The bound…
We aim to give more insights on adiabatic evolution concerning the occurrence of anti-crossings and their link to the spectral minimum gap $\Delta_{min}$. We study in detail adiabatic quantum computation applied to a specific combinatorial…
We investigate decoherence effects in the recently suggested quantum computation scheme using weak nonlinearities, strong probe coherent fields, detection and feedforward methods. It is shown that in the weak-nonlinearity-based quantum…
The geometric phase stands as a foundational concept in quantum physics, revealing deep connections between geometric structures and quantum dynamical evolution. Unlike dynamical phases, geometric phases exhibit intrinsic resilience to…
Quantum gates induced by geometric phases are intrinsically robust against noise due to their global properties of the evolution paths. Compared to conventional nonadiabatic geometric quantum computation (NGQC), the recently proposed…
Geometric phase is an indispensable element for achieving robust and high-fidelity quantum gates due to its built-in noise-resilience feature. However, due to the complexity of manipulation and the intrinsic leakage of the encoded quantum…
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…
In this thesis we describe methods for avoiding the detrimental effects of decoherence while at the same time still allowing for computation of the quantum information. The philosophy of the method discussed in the first part of this thesis…
We show that all Macroscopic Quantum Superpositions (MQS) based on phase-covariant quantum cloning are characterized by an anomalous high resilence to the de-coherence processes. The analysis supports the results of recent MQS experiments…
The decoherence induced on a single qubit by its interaction with the environment is studied. The environment is modelled as a scalar two-level boson system that can go through either first order or continuous excited state quantum phase…
Fault-tolerant quantum computing will require error rates far below those achievable with physical qubits. Quantum error correction (QEC) bridges this gap, but depends on decoders being simultaneously fast, accurate, and scalable. This…
By gradually changing the degree of the anisotropy in a XXZ chain we study the defect formation in a quantum system that crosses an extended critical region. We discuss two qualitatively different cases of quenches, from the…
The NP-complete problem of the travelling salesman (TSP) is considered in the framework of quantum adiabatic computation (QAC). We first derive a remarkable lower bound for the computation time for adiabatic algorithms in general as a…
Geometric quantum computation is the idea that geometric phases can be used to implement quantum gates, i.e., the basic elements of the Boolean network that forms a quantum computer. Although originally thought to be limited to adiabatic…
Obtaining high-fidelity and robust quantum gates is the key for scalable quantum computation, and one of the promising ways is to implement quantum gates using geometric phases, where the influence of local noises can be greatly reduced. To…
We describe a scheme for using an all-electrical, rapid, adiabatic population transfer between two spatially separated dots in a triple-quantum dot system. The electron spends no time in the middle dot and does not change its energy during…