Related papers: Extracting vacuum expectation values from approxim…
Preparing the ground state of a Hamiltonian is a problem of great significance in physics with deep implications in the field of combinatorial optimization. The adiabatic algorithm is known to return the ground state for sufficiently long…
Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic…
Quantum simulation has begun to penetrate the field of quantum chemistry in hopes of efficiently calculating ground state energies and approximating real-time evolution. With modern research highlighting nonadiabatic dynamics, tunably…
Tools necessary for quantum simulations of $1+1$ dimensional quantum chromodynamics are developed. When formulated in axial gauge and with two flavors of quarks, this system requires 12 qubits per spatial site with the gauge fields included…
We employ quantum mechanical principles in the computability exploration of the class of classically noncomputable Hilbert's tenth problem which is equivalent to the Turing halting problem in Computer Science. The Quantum Adiabatic Theorem…
We show how to compute vacuum expectation values from derivative expansions of the vacuum wave functional. Such expansions appear to be valid only for slowly varying fields, but by exploiting analyticity in a complex scale parameter we can…
We construct a qubit algebra from field creation and annihilation operators acting on a global vacuum state. Particles to be used as qubits are created from the vacuum by a near-deterministic single particle source. Our formulation makes…
The evaluation of the performance of adiabatic annealers is hindered by lack of efficient algorithms for simulating their behaviour. We exploit the analyticity of the standard model for the adiabatic quantum process to develop an efficient…
We combine classical heuristics with partial shadow tomography to enable efficient protocols for extracting information from correlated ab initio electronic systems encoded on quantum devices. By proposing the use of a correlation energy…
We show a certain kind of non-local operations can be simulated by sampling a set of local operations with a quasi-probability distribution when the task of a quantum circuit is to evaluate an expectation value of observables. Utilizing the…
We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state $\vert x \rangle$ that is proportional to the solution of the system of linear equations $A…
In this paper,we present a rigorous demonstration and discussion of the quantum adiabatic theorem for systems having a non degenerate continuous spectrum. A new strategy is initiated by defining a kind of gap, "a virtual gap", for the…
Expectation value estimation is ubiquitous in quantum algorithms. The expectation value of a Hamiltonian, which is essential in various practical applications, is often estimated by measuring a large number of Pauli strings on quantum…
Imaginary-time evolution plays an important role in algorithms for computing ground-state and thermal equilibrium properties of quantum systems, but can be challenging to simulate on classical computers. Many quantum algorithms for…
We study the Schwinger pair creation of scalar charged particles by a homogeneous electric field in an expanding universe in the quantum kinetic approach. We introduce an adiabatic vacuum for the scalar field based on the…
In scientific computing, the acceleration of atomistic computer simulations by means of custom hardware is finding ever growing application. A major limitation, however, is that the high efficiency in terms of performance and low power…
A new approach to extraction of quantum vacuum energy, in the context of the accelerated expansion, is proposed, and it is shown that experimentally realistic orders of values can be derived. The idea has been implemented in the framework…
Quantum computation by adiabatic evolution, as described in quant-ph/0001106, will solve satisfiability problems if the running time is long enough. In certain special cases (that are classically easy) we know that the quantum algorithm…
We experimentally demonstrate a virtual two-qubit gate and characterize it using quantum process tomography~(QPT). The virtual two-qubit gate decomposes an actual two-qubit gate into single-qubit unitary gates and projection gates in…
Within the effective mass approximation an adiabatic description of spheroidal and dumbbell quantum dot models in the regime of strong dimensional quantization is presented using the expansion of the wave function in appropriate sets of…