Related papers: Robustness of Adiabatic Quantum Computing
Adiabatic techniques are known to allow for engineering quantum states with high fidelity. This requirement is currently of large interest, as applications in quantum information require the preparation and manipulation of quantum states…
Nonadiabatic holonomic quantum computation has robust feature in suppressing control errors because of its holonomic feature. However, this kind of robust feature is challenged since the usual way of realizing nonadiabatic holonomic gates…
We explore in the framework of Quantum Computation the notion of computability, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm that exploits the quantum adiabatic processes is considered…
This thesis deals with a series of quantum computer implementation issues from the Kane 31P in 28Si architecture to Shor's integer factoring algorithm and beyond. The discussion begins with simulations of the adiabatic Kane CNOT and readout…
Integer factorization remains a significant challenge for classical computers and is fundamental to the security of RSA encryption. Adiabatic quantum algorithms present a promising solution, yet their practical implementation is limited by…
We present a technique that dramatically improves the accuracy of adiabatic state transfer for a broad class of realistic Hamiltonians. For some systems, the total error scaling can be quadratically reduced at a fixed maximum transfer rate.…
In this work, we examine the validity of quantum adiabatic theorem in thermodynamic systems. For a $d$-dimensional quantum many-body system, we show that the duration time $\tau_0$ required by its ground-state adiabatic process does not…
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the…
The ability to efficiently prepare ground states of quantum Hamiltonians via adiabatic protocols is typically limited by the smallest energy gap encountered during the quantum evolution. This presents a key obstacle for quantum simulation…
Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the remarkable efficiency in factoring a positive integer and searching databases faster than any currently known classical computing…
Besides the traditional circuit-based model of quantum computation, several quantum algorithms based on a continuous-time Hamiltonian evolution have recently been introduced, including for instance continuous-time quantum walk algorithms as…
Quantum computation by the adiabatic theorem requires a slowly varying Hamiltonian with respect to the spectral gap. We show that the Landau-Zener-St\"uckelberg oscillation phenomenon, that naturally occurs in quantum two level systems…
The evolution of a driven quantum system is said to be adiabatic whenever the state of the system stays close to an instantaneous eigenstate of its time-dependent Hamiltonian. The celebrated quantum adiabatic theorem ensures that such pure…
Adiabatic quantum control is a powerful tool for quantum engineering and a key component in some quantum computation models, where accurate control over the timing of the involved pulses is not needed. However, the adiabatic condition…
Holonomic quantum computation exploits the geometric evolution of eigenspaces of a degenerate Hamiltonian to implement unitary evolution of computational states. In this work we introduce a framework for performing scalable quantum…
Properties of Shor's algorithm and the related period-finding algorithm could serve as benchmarks for the operation of a quantum computer. Distinctive universal behaviour is expected for the probability for success of the period-finding…
The principal obstacle to quantum information processing with many qubits is decoherence. One source of decoherence is spontaneous emission which causes loss of energy and information. Inability to control system parameters with high…
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an…
We present a quantum algorithm for adiabatic state preparation on a gate-based quantum computer, with complexity polylogarithmic in the inverse error. Our algorithm digitally simulates the adiabatic evolution between two self-adjoint…
Quantum algorithms face significant challenges due to qubit susceptibility to environmental noise, and quantum error correction typically requires prohibitive resource overhead. This paper proposes that quantum algorithms may possess…