Related papers: Energetic cost of superadiabatic quantum computati…
A new class of time-energy uncertainty relations is directly derived from the Schr\"odinger equations for time-dependent Hamiltonians. Only the initial states and the Hamiltonians, but neither the instantaneous eigenstates nor the full…
Fast nonadiabatic control protocols known as shortcuts to adiabaticity have found a plethora of applications, but their use has been severely limited to speeding up the dynamics of isolated quantum systems. We introduce shortcuts for open…
Numerous sufficient conditions for adiabaticity of the evolution of a driven quantum system have been known for quite a long time. In contrast, necessary adiabatic conditions are scarce. A practicable necessary condition well-suited for…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
We present Counterdiabatic Reverse Annealing, a novel quantum annealing protocol that extends the range of application of reverse annealing to the previously inaccessible short-time domain. This is achieved by exploiting approximate…
Physical implementations of quantum computation must be scrutinized about their reliability under real conditions, in order to be considered as viable candidates. Among the proposed models, those based on adiabatic quantum dynamics have…
We propose a simple feedback-control scheme for adiabatic quantum computation with superconducting flux qubits. The proposed method makes use of existing on-chip hardware to monitor the ground-state curvature, which is then used to control…
Counterdiabatic (CD) driving has the potential to speed up adiabatic quantum state preparation by suppressing unwanted excitations. However, existing approaches either require intractable classical computations or are based on…
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one…
We propose a strategy to achieve the Grover search algorithm by adiabatic passage in a very efficient way. An adiabatic process can be characterized by the instantaneous eigenvalues of the pertaining Hamiltonian, some of which form a gap.…
Big Data is characterized by Volume, Velocity, Veracity and Complexity. The interaction between this huge data is complex with an associated free will having dynamic and non linear nature. We reduced big data based on its characteristics,…
We study superadiabatic quantum control of a three-level quantum system whose energy spectrum exhibits multiple avoided crossings. In particular, we investigate the possibility of treating the full control task in terms of independent…
Adiabaticity is a cornerstone of many promising approaches to quantum control, computing, and simulation. In practice, however, there is always a trade-off. Although the deleterious effects of noise can be diminished by running a control…
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum…
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…
Future miniaturization and mobilization of computing devices requires energy parsimonious `adiabatic' computation. This is contingent on logical reversibility of computation. An example is the idea of quantum computations which are…
The theoretical investigation of non-adiabatic processes is hampered by the complexity of the coupled electron-nuclear dynamics beyond the Born-Oppenheimer approximation. Classically, the simulation of such reactions is limited by the…
We investigate the irreconcilability issue that raises in translating the search algorithm from the Continuous-Time Quantum Walk (CTQW) framework to the Adiabatic Quantum Computing (AQC) framework. For the AQC formulation to evolve along…
Adiabatic protocols are employed across a variety of quantum technologies, from implementing state preparation and individual operations that are building blocks of larger devices, to higher-level protocols in quantum annealing and…
Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as…