Related papers: Preparing ground states of quantum many-body syste…
We present an efficient approach for preparing ground states in the context of strongly interacting local quantum field theories on quantum computers. The approach produces the vacuum state in a time proportional to the square-root of the…
The computational cost of exact methods for quantum simulation using classical computers grows exponentially with system size. As a consequence, these techniques can only be applied to small systems. By contrast, we demonstrate that quantum…
We propose new quantum algorithms for thermal and ground state preparation based on system-bath interactions. These algorithms require only forward evolution under a system-bath Hamiltonian in which the bath is a single reusable ancilla…
Tasked with the challenge to build better and better computers, quantum computing and classical computing face the same conundrum: the success of classical computing systems. Small quantum computing systems have been demonstrated, and…
The ground state properties of quantum many-body systems are a subject of interest across chemistry, materials science, and physics. Thus, algorithms for finding ground states can have broad impacts. Variational quantum algorithms are one…
Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…
The current state of quantum computing is commonly described as the Noisy Intermediate-Scale Quantum era. Available computers contain a few dozens of qubits and can perform a few dozens of operations before the inevitable noise erases all…
The exact ground state of a strongly interacting quantum many-body system can be obtained by evolving a trial state with finite overlap with the ground state to infinite imaginary time. In this work, we use a newly discovered fourth order…
Quantum Computing allows, in principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register, offering a promising solution to overcome the limitations of traditional quantum chemistry…
A quantum algorithm is proposed to solve the Satisfiability problems by the ground-state quantum computer. The scale of the energy gap of the ground-state quantum computer is analyzed for the 3-bit Exact Cover problem. The time cost of this…
Recent improvements in control of quantum systems make it seem feasible to finally build a quantum computer within a decade. While it has been shown that such a quantum computer can in principle solve certain small electronic structure…
A simple method is proposed to prepare conveniently the effective pure state |00...0><0...00| with any number of qubits in a quantum ensemble. The preparation is based on the temporal averaging (Knill, Chuang, and Laflamme, Phys.Rev.A 57,…
Finding eigenstates of a given many-body Hamiltonian is a long-standing challenge due to the perceived computational complexity. Leveraging on the hardware of a quantum computer accommodating the exponential growth of the Hilbert space size…
Accurate models for open quantum systems -- quantum states that have non-trivial interactions with their environment -- may aid in the advancement of a diverse array of fields, including quantum computation, informatics, and the prediction…
A general quantum algorithm for solving a problem is discussed. The number of steps required to solve a problem using this method is independent of the number of cases that has to be considered classically. Hence, it is more efficient than…
Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms supports using multi-valued logic, which promises a boost in…
Solving the quantum-mechanical many-body problem requires scalable computational approaches, which are rooted in a good understanding of the physics of correlated electronic systems. Interacting electrons in a magnetic field display a huge…
We present an efficient method to prepare states of a many-body system on quantum hardware, first isolating individual quantum numbers and then using time evolution to isolate the energy. Our method in its simplest form requires only one…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…
We describe a solid state implementation of a quantum computer using ballistic single electrons as flying qubits in 1D nanowires. We show how to implement all the steps required for universal quantum computation: preparation of the initial…