Related papers: Quantum Gates with Controlled Adiabatic Evolutions
We introduce an algorithm to perform an optimal adiabatic evolution that operates without an apriori knowledge of the system spectrum. By probing the system gap locally, the algorithm maximizes the evolution speed, thus minimizing the total…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
The physical implementation of holonomic quantum computation is challenging due to the needed complex controllable interactions in multilevel quantum systems. Here we propose to implement nonadiabatic holonomic quantum computation with…
Transitionless quantum driving achieves adiabatic evolution in a hurry, using a counter-diabatic Hamiltonian to stifle non-adiabatic transitions. Here this strategy is cast in terms of a generator of adiabatic transport, leading to a…
Adiabatic quantum computation employs a slow change of a time-dependent control function (or functions) to interpolate between an initial and final Hamiltonian, which helps to keep the system in the instantaneous ground state. When the…
Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present…
It is proposed that high-speed universal quantum gates can be realized by using non-Abelian holonomic transformation. A cyclic evolution path which brings the system periodically back to a degenerate qubit subspace is crucial to holonomic…
Nonadiabatic geometric quantum computation (NGQC) and nonadiabatic holonomic quantum computation (NHQC) have been proposed to reduce the run time of geometric quantum gates. However, in terms of robustness against experimental control…
In this paper we study the implementation of non-adiabatic geometrical quantum gates with in semiconductor quantum dots. Different quantum information enconding/manipulation schemes exploiting excitonic degrees of freedom are discussed. By…
Adiabatic quantum algorithms represent a promising approach to universal quantum computation. Whilst in a closed system these algorithms are limited by avoided level crossings, where the gap becomes exponentially small in the system size,…
Noncyclic geometric gates aim to overcome the stringent constraints of conventional cyclic conditions and enhance the flexibility in evolution choice. Conceptually, they can also avoid the error problems arising from the violation of…
The implementation of holonomic quantum computation on superconducting quantum circuits is challenging due to the general requirement of controllable complicated coupling between multilevel systems. Here we solve this problem by proposing a…
We review a scheme for the systematic design of quantum control protocols based on shortcuts to adiabaticity in few-level quantum systems. The adiabatic dynamics is accelerated by introducing high-frequency modulations in the control…
Despite its simplicity and strong theoretical guarantees, adiabatic state preparation has received considerably less interest than variational approaches for the preparation of low-energy electronic structure states. Two major reasons for…
Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…
We show how to construct quantum gate arrays that can be programmed to perform different unitary operations on a data register, depending on the input to some program register. It is shown that a universal quantum gate array - a gate array…
Non-adiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors. However, all the previous schemes have to use at least two sequentially implemented gates to realize a general…
Topological quantum computation has been extensively studied due to its robustness against decoherence. A conventional way to realize it is by adiabatic operations---it requires relatively long time to accomplish so that the speed of…
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…
In the current framework of Geometric Quantum Machine Learning, the canonical method for constructing a variational ansatz that respects the symmetry of some group action is by forcing the circuit to be equivariant, i.e., to commute with…