相关论文: Compressed Simulation of evolutions of the XY-mode…
Since several years the preparation and manipulation of a small number of quantum systems in a controlled and coherent way is feasible in many experiments. In fact, these experiments are nowadays commonly used for quantum simulation and…
In [R. Jozsa, B. Kraus, A. Miyake, J. Watrous, Proc. R. Soc. A {\bf 466}, 809-830 (2010)] it has been shown that a match gate circuit running on n qubits can be compressed to a universal quantum computation on \log(n)+3 qubits. Here, we…
The notion of compressed quantum computation is employed to simulate the Ising interaction of a 1D--chain consisting out of $n$ qubits using the universal IBM cloud quantum computer running on $\log(n)$ qubits. The external field parameter…
The field of quantum computing has grown fast in recent years, both in theoretical advancements and the practical construction of quantum computers. These computers were initially proposed, among other reasons, to efficiently simulate and…
To gain deeper insight into the dynamics of complex quantum systems we need a quantum leap in computer simulations. We can not translate quantum behaviour arising with superposition states or entanglement efficiently into the classical…
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…
The current generation of noisy intermediate scale quantum computers introduces new opportunities to study quantum many-body systems. In this paper, we show that quantum circuits can provide a dramatically more efficient representation than…
Quantum time dynamics (QTD) is considered a promising problem for quantum supremacy on near-term quantum computers. However, QTD quantum circuits grow with increasing time simulations. This study focuses on simulating the time dynamics of…
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
Quantum state preparation by adiabatic evolution is currently rendered ineffective by the long implementation times of the underlying quantum circuits, comparable to the decoherence time of present and near-term quantum devices. These…
A quantum simulator is a restricted class of quantum computer that controls the interactions between quantum bits in a way that can be mapped to certain difficult quantum many-body problems. As more control is exerted over larger numbers of…
We present a general method for studying coupled qubits driven by adiabatically changing external parameters. Extended calculations are provided for a two-bit Hamiltonian whose eigenstates can be used as logical states for a quantum CNOT…
The observation that concepts from quantum information has generated many alternative indicators of quantum phase transitions hints that quantum phase transitions possess operational significance with respect to the processing of quantum…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
In this work we study a system that consists of $2M$ matter qubits that interact through a boson sampling circuit, i.e., an $M$-port interferometer, embedded in two different architectures. We prove that, under the conditions required to…
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…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
We explore the role of entanglement in adiabatic quantum optimization by performing approximate simulations of the real-time evolution of a quantum system while limiting the amount of entanglement. To classically simulate the time evolution…
Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the remarkable efficiency in factoring a positive integer and searching databases faster than any currently known classical computing…