相关论文: Quantum simulators, continuous-time automata, and …
Quantum computing is gaining increased attention as a potential way to speed up simulations of physical systems, and it is also of interest to apply it to simulations of classical plasmas. However, quantum information science is…
The circuit-to-Hamiltonian construction has found widespread use within the field of Hamiltonian complexity, particularly for proving QMA-hardness results. In this work we examine the ground state energies of the Hamiltonian for standard…
Quantum machine learning with parametrised quantum circuits has attracted significant attention over the past years as an early application for the era of noisy quantum processors. However, the possibility of achieving concrete advantages…
Although the Hamiltonian in quantum physics has to be a linear operator, it is possible to make quantum systems behave as if their Hamiltonians contained antilinear (i.e., semilinear or conjugate-linear) terms. For any given quantum system,…
We show that the time evolution of the wave function of a quantum mechanical many particle system can be implemented very efficiently on a quantum computer. The computational cost of such a simulation is comparable to the cost of a…
Using quantum systems to efficiently solve quantum chemistry problems is one of the long-sought applications of near-future quantum technologies. In a recent work, ultra-cold fermionic atoms have been proposed for these purposes by showing…
This paper extends work done to date on quantum computation by associating potentials with different types of computation steps. Quantum Turing machine Hamiltonians, generalized to include potentials, correspond to sums over tight binding…
A broad range of quantum optimisation problems can be phrased as the question whether a specific system has a ground state at zero energy, i.e.\ whether its Hamiltonian is frustration free. Frustration-free Hamiltonians, in turn, play a…
Nowadays, quantum simulation schemes come in two flavours. Either they are continuous-time discrete-space models (a.k.a Hamiltonian-based), pertaining to non-relativistic quantum mechanics. Or they are discrete-spacetime models (a.k.a…
We classify phases of a bosonic lattice model based on the computational complexity of classically simulating the system. We show that the system transitions from being classically simulable to classically hard to simulate as it evolves in…
Quantum computers are expected to help us to achieve accurate simulation of the dynamics of many-body quantum systems. However, the limitations of current NISQ devices prevents us from realising this goal today. Recently an algorithm for…
We show how to implement quantum computation on a system with an intrinsic Hamiltonian by controlling a limited subset of spins. Our primary result is an efficient control sequence on a nearest-neighbor XY spin chain through control of a…
The simulation of quantum systems has been a key aim of quantum technologies for decades, and the generalisation to open systems is necessary to include physically realistic systems. We introduce an approach for quantum simulations of open…
Simulation of time dynamical physical problems has been a challenge for classical computers due to their time-complexity. To demonstrate the dominance of quantum computers over classical computers in this regime, here we simulate a…
Quantum computation can proceed solely through single-qubit measurements on an appropriate quantum state, such as the ground state of an interacting many-body system. We investigate a simple spin-lattice system based on the cluster-state…
Modeling non-Hermitian Hamiltonians is increasingly important in classical and quantum domains, especially when studying open systems, $PT$ symmetry, and resonances. However, the quantum simulation of these models has been limited by the…
We present two techniques that can greatly reduce the number of gates required to realize an energy measurement, with application to ground state preparation in quantum simulations. The first technique realizes that to prepare the ground…
The use of quantum computers to calculate the ground state (lowest) energies of a spin lattice of electrons described by the Fermi-Hubbard model of great importance in condensed matter physics has been studied. The ability of quantum bits…
The properties of strongly-coupled lattice gauge theories at finite density as well as in real time have largely eluded first-principles studies on the lattice. This is due to the failure of importance sampling for systems with a complex…
Imaginary time evolution is a powerful technique for computing the ground state of quantum Hamiltonians, where the convergence to ground state in asymptotic imaginary time is guaranteed. However, implementing this method on quantum…