Related papers: Adiabatic Quantum Counting by Geometric Phase Esti…
Quantum information processing is likely to have far-reaching impact in the field of artificial intelligence. While the race to build an error-corrected quantum computer is ongoing, noisy, intermediate-scale quantum (NISQ) devices provide…
We discuss in this chapter the basics of adiabatic computation, as well as some physical implementations. After a short introduction of the quantum circuit model, we describe quantum adiabatic computation, quantum annealing, and the strong…
We explain why quantum adiabatic evolution and simulated annealing perform similarly in certain examples of searching for the minimum of a cost function of n bits. In these examples each bit is treated symmetrically so the cost function…
Motivated for the fault tolerant quantum computation, quantum gate by adiabatic geometric phase shift is extensively investigated. In this paper, we demonstrate the nonadiabatic scheme for the geometric phase shift and conditional geometric…
The phase relation between quantum states represents an essential resource for the storage and processing of quantum information. While quantum phases are commonly controlled dynamically by tuning energetic interactions, utilizing geometric…
The geometric phase stands as a foundational concept in quantum physics, revealing deep connections between geometric structures and quantum dynamical evolution. Unlike dynamical phases, geometric phases exhibit intrinsic resilience to…
We lay the foundation for a benchmarking methodology for assessing current and future quantum computers. We pose and begin addressing fundamental questions about how to fairly compare computational devices at vastly different stages of…
Nonadiabatic geometric phases are only dependent on the evolution path of a quantum system but independent of the evolution details, and therefore quantum computation based on nonadiabatic geometric phases is robust against control errors.…
We adopt a geometric approach to describe the performance of adiabatic quantum machines, operating under slow time-dependent driving and in contact to two or more reservoirs with a temperature bias during all the cycle. We show that the…
Analog quantum algorithms are formulated in terms of Hamiltonians rather than unitary gates and include quantum adiabatic computing, quantum annealing, and the quantum approximate optimization algorithm (QAOA). These algorithms are…
Phase estimation is known to be a robust method for single-qubit gate calibration in quantum computers, while Bayesian estimation is widely used in devising optimal methods for learning in quantum systems. We present Bayesian phase…
The Berry curvature and its descendant, the Berry phase, play an important role in quantum mechanics. They can be used to understand the Aharonov-Bohm effect, define topological Chern numbers, and generally to investigate the geometric…
The quantum adiabatic theorem incorporating the Berry phase phenomenon can be characterized as a factorization of the time evolution operator into a path-dependent geometric factor, a usual dynamical factor and a non-adiabatic factor that…
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quantum state generation'. This approach provides intriguing links…
Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The…
We give an overview of a quantum adiabatic algorithm for Hilbert's tenth problem, including some discussions on its fundamental aspects and the emphasis on the probabilistic correctness of its findings. For the purpose of illustration, the…
The variational quantum eigensolver (VQE) is an algorithm to find eigenenergies and eigenstates of systems in quantum chemistry and quantum many-body physics. The VQE is one of the most promising applications of near-term quantum devices to…
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a…
We introduce an adiabatic perturbation theory for quantum systems with degenerate energy spectra. This perturbative series enables one to rigorously establish conditions for the validity of the adiabatic theorem of quantum mechanics for…
We study quantum adiabatic dynamics, where the slowly moving field is influenced by system's state (feedback). The information for the feedback is gained from non-disturbating measurements done on an ensemble of identical non-interacting…