A double-slit proposal for quantum annealing

  title={A double-slit proposal for quantum annealing},
  author={Humberto Munoz-Bauza and Huo Chen and Daniel A. Lidar},
  journal={npj Quantum Information},
We formulate and analyze a double-slit proposal for quantum annealing, which involves observing the probability of finding a two-level system (TLS) undergoing evolution from a transverse to a longitudinal field in the ground state at the final time tf. We demonstrate that for annealing schedules involving two consecutive diabatic transitions, an interference effect is generated akin to a double-slit experiment. The observation of oscillations in the ground state probability as a function of tf… 
Locally suppressed transverse-field protocol for diabatic quantum annealing
Diabatic quantum annealing (DQA) is an alternative algorithm to adiabatic quantum annealing that can be used to circumvent the exponential slowdown caused by small minima in the annealing energy
Variationally scheduled quantum simulation
In the present work, a variational method for determining the optimal scheduling procedure within the context of adiabatic state preparation is investigated and is found to exhibit resilience against control errors, which are commonly encountered within the realm of quantum computing.
Customized Quantum Annealing Schedules
In a typical quantum annealing protocol, the system starts with a transverse field Hamiltonian which is gradually turned off and replaced by a longitudinal Ising Hamiltonian. The ground state of the
Dynamics of reverse annealing for the fully connected p -spin model
Reverse annealing is a variant of quantum annealing that starts from a given classical configuration of spins (qubits). In contrast to the conventional formulation, where one starts from a uniform
Probing the universality of topological defect formation in a quantum annealer: Kibble-Zurek mechanism and beyond
The number of topological defects created in a system driven through a quantum phase transition exhibits a power-law scaling with the driving time. This universal scaling law is the key prediction of
Why and When Pausing is Beneficial in Quantum Annealing
Recent empirical results using quantum annealing hardware have shown that mid anneal pausing has a surprisingly beneficial impact on the probability of finding the ground state for of a variety of
Finding spin glass ground states using quantum walks
This work investigates the performance of continuous-time quantum walks as a tool for finding spin glass ground states, a problem that serves as a useful model for realistic optimization problems and uncover significant ways in which solving spin glass problems differs from applying quantum walks to the search problem.
A two-qubit entangling gate based on a two-spin gadget
The faster speed and operational convenience of two-qubit gate with flux bias control makes it an important candidate for future large-scale quantum computers based on high coherence flux qubits.
Demonstration of long-range correlations via susceptibility measurements in a one-dimensional superconducting Josephson spin chain
s, Vol. 2018 (2018) p. C26.001. [12] A. Kerman, Paramagnet tree coupling of spin qubits (U.S. Patent 10 719 775, Jul. 21st, 2020). [13] S. J. Weber, G. O. Samach, D. Hover, S. Gustavsson, D. K. Kim,
Generalized adiabatic impulse approximation
Non-adiabatic transitions in multilevel systems appear in various fields of physics, but it is not easy to analyze their dynamics in general. In this paper, we propose to extend the adiabatic impulse


Quantum annealing in the transverse Ising model
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between
Reexamination of the evidence for entanglement in a quantum annealer
A recent experiment [T. Lanting et al., Phys. Rev. X 4, 021041 (2014)] claimed to provide evidence of up to eight-qubit entanglement in a D-Wave quantum annealing device. However, entanglement was
A coherent quantum annealer with Rydberg atoms
Combining the well-developed quantum simulation toolbox for Rydberg atoms with the recently proposed Lechner-Hauke-Zoller (LHZ) architecture allows one to build a prototype for a coherent adiabatic quantum computer with all-to-all Ising interactions and, therefore, a platform for quantum annealing.
Quantum annealing for the number-partitioning problem using a tunable spin glass of ions
This work demonstrates that in a trapped ion setup, with present day technology, it is possible to realize a spin model of the Mattis-type that exhibits spin glass phases by controlling the detuning of the spin-phonon coupling.
Dynamics of reverse annealing for the fully connected p -spin model
Reverse annealing is a variant of quantum annealing that starts from a given classical configuration of spins (qubits). In contrast to the conventional formulation, where one starts from a uniform
The performance of the quantum adiabatic algorithm on spike Hamiltonians
An improved ansatz for the ground state leads to a method for predicting the location of avoided crossings in the excited energy states of the thin spike Hamiltonian, and a recursion relation is used to understand the ordering of some of these avoided crossings as a step towards analyzing the previously observed diabatic cascade phenomenon.
Exploring More-Coherent Quantum Annealing
This paper discusses recent experimental progress related to one of the key design dimensions: qubit coherence, and reports on techniques and preliminary measurement results addressing two of the challenges: crosstalk calibration and qubit readout.
Quantum annealing with manufactured spins
This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples, and may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effective approaches to solving certain classes of hard combinatorial optimization problems.
Tunneling and speedup in quantum optimization for permutation-symmetric problems
Tunneling is often claimed to be the key mechanism underlying possible speedups in quantum optimization via quantum annealing (QA), especially for problems featuring a cost function with tall and