Related papers: Superadiabatic Control of Quantum Operations
We describe a many-body quantum system which can be made to quantum compute by the adiabatic application of a large applied field to the system. Prior to the application of the field quantum information is localized on one boundary of the…
In this thesis, it is presented a set of results in adiabatic dynamics (closed and open system) and transitionless quantum driving that promote some advances in our understanding on quantum control and Hamiltonian inverse engineering. In…
We describe tensor network algorithms to optimize quantum circuits for adiabatic quantum computing. To suppress diabatic transitions, we include counterdiabatic driving in the optimization and utilize variational matrix product operators to…
Recently, nonadiabatic geometric quantum computation has been received great attentions, due to its fast operation and intrinsic error resilience. However, compared with the corresponding dynamical gates, the robustness of implemented…
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…
A scalable superconducting architecture for adiabatic quantum computers is proposed. The architecture is based on time-independent, nearest-neighbor interqubit couplings: it can handle any problem in the class NP even in the presence of…
Rapid and efficient preparation, manipulation and transfer of quantum states through an array of quantum dots (QDs) is a demanding requisite task for quantum information processing and quantum computation in solid-state physics.…
The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian…
Nonadiabatic holonomic operations are based on nonadiabatic non-Abelian geometric phases, hence possessing the inherent geometric features for robustness against control errors. However, nonadiabatic holonomic operations are still sensitive…
The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables,…
We introduce a digital-analog quantum computing framework that enables counterdiabatic protocols to be implemented at constant circuit depth, allowing fast and resource-efficient quantum state preparation on current quantum hardware.…
We derive an integral expression for the filter-transfer function of an arbitrary one-qubit gate through the use of dynamical invariant theory and Hamiltonian reverse engineering. We use this result to define a cost function which can be…
We construct a measure for the adiabatic contribution to quantum transitions in an arbitrary basis, tackling the generic complex case where dynamics is only partially adiabatic, simultaneously populates several eigenstates and transitions…
We propose a methodology to design optimal pulses for achieving quantum optimal control on molecular systems. Our approach constrains pulse shapes to linear combinations of a fixed number of experimentally relevant pulse functions. Quantum…
In topological quantum computing, unitary operations on qubits are performed by adiabatic braiding of non-Abelian quasiparticles, such as Majorana zero modes, and are protected from local environmental perturbations. In the adiabatic…
We theoretically study nonadiabatic corrections for charge pumping in a noninteracting electron model of a single-level quantum dot. We derive a formula for the velocity limit of parameter driving to realize adiabatic pumping and illustrate…
The goal of this paper is to introduce building blocks for adiabatic quantum algorithms. Adiabatic quantum computing uses the principle of quantum annealing, which implies that a carefully controlled energy solution is optimal and…
We show enough evidence that a structured version of Adiabatic Quantum Computation (AQC) is efficient for most satisfiability problems. More precisely, when the success probability is fixed beforehand, the computational resources grow…
We investigate the performance of a quantum thermal machine operating in finite time based on shortcut-to-adiabaticity techniques. We compute efficiency and power for a quantum harmonic Otto engine by taking the energetic cost of the…
Adiabatic processes are important for studying the dynamics of a time-dependent system. Conventionally, the adiabatic processes can only be achieved by varying the system slowly. We speed up both classical and quantum adiabatic processes by…