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 language of conventional computers. The final solution to this problem is a universal quantum computer [1], suggested in 1982 and envisioned to become functional within the next decade(s); a shortcut was proposed via simulating the quantum behaviour of interest in a different quantum system, where all parameters and interactions can be controlled and the outcome detected sufficiently well. Here we study the feasibility of a quantum simulator based on trapped ions [2]. We experimentally simulate the adiabatic evolution of the smallest non-trivial spin system from the paramagnetic into the (anti-)ferromagnetic order with a quantum magnetisation for two spins of 98%, controlling and manipulating all relevant parameters of the Hamiltonian independently via electromagnetic fields. We prove that the observed transition is not driven by thermal fluctuations, but of quantum mechanical origin, the source of quantum fluctuations in quantum phase transitions [3]. We observe a final superposition state of the two degenerate spin configurations for the ferromagnetic and the antiferromagnetic order, respectively. These correspond to deterministically entangled states achieved with a fidelity up to 88%. Our work demonstrates a building block for simulating quantum spin-Hamiltonians with trapped ions. The method has potential for scaling to a higher number of coupled spins [2].
Making use of an universal quantum network or QCPU proposed by me [6], some special quantum networks for simulating some quantum systems are given out. Specially, it is obtained that the quantum network for the time evolution operator which can simulate, in general, Schrödinger equation.
We develop a means of simulating the evolution and measurement of a multipartite quantum state under discrete or continuous evolution using another quantum system with states and operators lying in a real Hilbert space. This extends previous results which were unable to simulate local evolution and measurements with local operators and was limited to discrete evolution. We also detail applications to Bell inequalities and self-testing of quantum apparatus.
An impossibility theorem on approximately simulating quantum non-integrable Hamiltonian systems is presented here. This result shows that there is a trade-off between the unitary property and the energy expectation conservation law in time-descretization of quantum non-integrable systems, whose classical counterpart is Ge-Marsden's impossibility result about simulating classically non-integrable Hamiltonian systems using integration schemes preserving symplectic (Lie-Poisson) property.
We investigate the problem of simulating classical stochastic processes through quantum dynamics, and present three scenarios where memory or time quantum advantages arise. First, by introducing and analysing a quantum version of the embeddability problem for stochastic matrices, we show that quantum memoryless dynamics can simulate classical processes that necessarily require memory. Second, by extending the notion of space-time cost of a stochastic process $P$ to the quantum domain, we prove an advantage of the quantum cost of simulating $P$ over the classical cost. Third, we demonstrate tha…
We discuss the problem of when a set of measurements made on an entangled source can be simulated with a classically correlated source. This is discussed in general and some examples are given. The question of which aspects of quantum imaging can be simulated by classically correlated sources is examined.
We demonstrate that it is possible to simulate Bell violations using probabilistic methods. A quantum state corresponding to optical experiments that violate the Bell inequality is generated, demonstrating that these quantum paradoxes can indeed be simulated probabilistically. This provides an explicit counter-example to Feynman's claim that such classical simulations could not be carried out.
We present a quantum algorithm for simulating the wave equation under Dirichlet and Neumann boundary conditions. The algorithm uses Hamiltonian simulation and quantum linear system algorithms as subroutines. It relies on factorizations of discretized Laplacian operators to allow for improved scaling in truncation errors and improved scaling for state preparation relative to general purpose linear differential equation algorithms. We also consider using Hamiltonian simulation for Klein-Gordon equations and Maxwell's equations.
This thesis provides an overview of an approach to quantum simulations using magnesium-25 ions stored in a linear Paul trap as the carriers of quantum information. Their quantum state is manipulated and read out using ultraviolet laser beams. Several important steps towards realising the first experiments have been undertaken, the most striking of which is cooling the ions to their motional ground state. We describe a first experiment simulating cosmological particle creation in the Early Universe and discuss the expected results.
We show that open quantum systems of two-level atoms symmetrically coupled to a single-mode photon field can be efficiently simulated by applying a SU(4) group theory to quantum master equations. This is important since many foundational examples in quantum optics fall into this class. We demonstrate the method by finding exact solutions for many-atom open quantum systems such as lasing and steady state superradiance.
Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and experimental study of an algorithm to find the low-lying spectrum of a Hamiltonian. While the number of elementary quantum gates does scale polynomially with the size of the system, it increases inversely to the desired error bound $ε$. Making such simulations robust to decoherence using fault-tolerance constructs requires an additional factor of $1/ ε$ gates. Thes…
We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries. We also note that a related lower bound holds for arbitrary n-qubit gates.
We optimise a translationally invariant, sequential quantum circuit on a superconducting quantum device to simulate the groundstate of the quantum Ising model through its quantum critical point. We further demonstrate how the dynamical quantum critical point found in quenches of this model across its quantum critical point can be simulated. Our approach avoids finite-size scaling effects by using sequential quantum circuits inspired by infinite matrix product states. We provide efficient circuits and a variety of error mitigation strategies to implement, optimise and time-evolve these states.
Some forms of classical simulations of quantum type probabilities and correlations are capable of violating Boole's conditions of possible experience, such as the Clauser-Horne-Shimony-Holt inequality, even beyond the Tsirelson bound. This can be achieved by communicating a single bit encoding the measurement context.
We present an open source computational framework geared towards the efficient numerical investigation of open quantum systems written in the Julia programming language. Built exclusively in Julia and based on standard quantum optics notation, the toolbox offers speed comparable to low-level statically typed languages, without compromising on the accessibility and code readability found in dynamic languages. After introducing the framework, we highlight its features and showcase implementations of generic quantum models. Finally, we compare its usability and performance to two well-established…
Sequences of compatible quantum measurements can be contextual and any simulation with a classical model accounting for the quantum observations, needs to use some internal memory. In Ref. [New J. Phys. 13, 113011 (2011)], it was shown that simulating the sequences of compatible observables from the Peres-Mermin scenario requires at least three different memory states in order to be not in contradiction with the deterministic predictions of quantum theory. We extend this analysis to the probabilistic quantum predictions and ask how much memory is required to simulate the quantum correlations g…
The difficulty of simulating quantum systems, well-known to quantum chemists, prompted the idea of quantum computation. One can avoid the steep scaling associated with the exact simulation of increasingly large quantum systems on conventional computers, by mapping the quantum system to another, more controllable one. In this review, we discuss to what extent the ideas in quantum computation, now a well-established field, have been applied to chemical problems. We describe algorithms that achieve significant advantages for the electronic-structure problem, the simulation of chemical dynamics, p…
Recently, constant-depth quantum circuits are proved more powerful than their classical counterparts at solving certain problems, e.g., the two-dimensional (2D) hidden linear function (HLF) problem regarding a symmetric binary matrix. To further investigate the boundary between classical and quantum computing models, in this work we propose a high-performance two-stage classical scheme to solve a full-sampling variant of the 2D HLF problem, which combines traditional classical parallel algorithms and a gate-based classical circuit model together for exactly simulating the target shallow quantu…
We give a classical protocol to exactly simulate quantum correlations implied by a spin $s$ singlet state for the infinite sequence of \textit{integer} spin $s={1,4,13,...}$ satisfying $(2s+1)=3^{n}$,where $n$ is a positive integer.The required amount of communication is found to increase as $log_{3}d^{2}$ where $d=2s+1$ is the dimension of the spin $s$ Hilbert space.
Due to complexity of the systems and processes it addresses, the development of computational quantum physics is influenced by the progress in computing technology. Here we overview the evolution, from the late 1980s to the current year 2020, of the algorithms used to simulate dynamics of quantum systems. We put the emphasis on implementation aspects and computational resource scaling with the model size and propagation time. Our mini-review is based on a literature survey and our experience in implementing different types of algorithms.
C++QED is a framework for simulating open quantum dynamics in general. Historically, it has in the first place been developed for problems in moving-particle cavity QED, but since then has been applied in other fields as well. It is known to be able to simulate full Master equation up to several thousand, and quantum trajectories up to several hundred thousand dimensions. The basic idea of the framework is to allow users to build arbitrarily complex interacting quantum systems from elementary free subsystems and interactions between them, and simulate their time evolution with a number of avai…
A Toffoli gate ($C^{n}$-NOT gate) is regarded as an important unitary gate in quantum computation, and is simulated by a quantum circuit composed of $C^{2}$-NOT gates. This paper presents a quantum circuit with a new configuration of $C^{2}$-NOT gates simulating a $C^{2m+1}$-NOT operation under the condition $m=2^{n}$ ($n=1,2,...$). The circuit is composed of units called multi-qubits gates (MQGs), each of which performs $m$ $C^{2}$-NOT operations simultaneously on $3m$ qubits. Simultaneous operations eliminate the need to manipulate qubits individually, as required in conventional quantum cir…
Many-party correlations between measurement outcomes in general probabilistic theories are given by conditional probability distributions obeying the non-signalling condition. We show that any such distribution can be obtained from classical or quantum theory, by relaxing positivity constraints on either the mixed state shared by the parties, or the local functions which generate measurement outcomes. Our results apply to generic non-signalling correlations, but in particular they yield two distinct quasi-classical models for quantum correlations.
We describe a nuclear magnetic resonance (NMR) experiment which implements an efficient one-to-two qubit phase-covariant cloning machine(QPCCM). In the experiment we have achieved remarkably high fidelities of cloning, 0.848 and 0.844 respectively for the original and the blank qubit. This experimental value is close to the optimal theoretical value of 0.854. We have also demonstrated how to use our phase-covariant cloning machine for quantum simulations of bit by bit eavesdropping in the four-state quantum key distribution protocol.
We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the dynamics due to the diagonal component of the Hamiltonian from the dynamics generated by its off-diagonal part, which we encode using the linear combination of unitaries technique. Our method has an optimal dependence on the desired precision and, as we illustrate, generally requires considerably fewer resources than the current state-of-the-art. We provide a…
We present an efficient quantum algorithm for simulating the evolution of a sparse Hamiltonian H for a given time t in terms of a procedure for computing the matrix entries of H. In particular, when H acts on n qubits, has at most a constant number of nonzero entries in each row/column, and |H| is bounded by a constant, we may select any positive integer $k$ such that the simulation requires O((\log^*n)t^{1+1/2k}) accesses to matrix entries of H. We show that the temporal scaling cannot be significantly improved beyond this, because sublinear time scaling is not possible.
We introduce an open-source software library Graphix, which optimizes and simulates measurement-based quantum computation (MBQC). By combining the measurement calculus with an efficient graph state simulator, Graphix allows the classical preprocessing of Pauli measurements in the measurement patterns, significantly reducing the number of operations required to perform the quantum computation while maintaining determinism. For a measurement pattern translated from a quantum circuit, this corresponds to the preprocessing of all Clifford gates, and this improvement in the one-way model is importa…
Hybrid quantum-classical (HQC) algorithms make it possible to use near-term quantum devices supported by classical computational resources by useful control schemes. In this paper, we develop an HQC algorithm using an efficient variational optimization approach to simulate open system dynamics under the Noisy-Intermediate Scale Quantum(NISQ) computer. Using the time-dependent variational principle (TDVP) method and extending it to McLachlan TDVP for density matrix which involves minimization of Frobenius norm of the error, we apply the unitary quantum circuit to obtain the time evolution of th…
The finite-time isothermal process is fundamental in quantum thermodynamics yet complicated with combination of changing control parameters and the interaction with the thermal bath. Such complexity prevents the direct application of the traditional thermodynamics measurement of the relevant quantities. In this paper, we provide a discrete-step method to separate the work done and the heat exchange in the isothermal process by decomposing the process into piecewise adiabatic and isochoric processes. The piecewise control scheme makes it possible to simulate the whole process on a generic quant…
We study the physical resources required to implement general quantum operations, and provide new bounds on the minimum possible size which an environment must be in order to perform certain quantum operations. We prove that contrary to a previous conjecture, not all quantum operations on a single-qubit can be implemented with a single-qubit environment, even if that environment is initially prepared in a mixed state. We show that a mixed single-qutrit environment is sufficient to implement a special class of operations, the generalized depolarizing channels.
We demonstrate how to simulate both discrete and continuous stochastic evolution of a quantum many body system subject to measurements using matrix product states. A particular, but generally applicable, measurement model is analyzed and a simple representation in terms of matrix product operators is found. The technique is exemplified by numerical simulations of the anti-ferromagnetic Heisenberg spin-chain model subject to various instances of the measurement model. In particular we focus on local measurements with small support and non-local measurements which induces long range correlations…
We study the open system dynamics of a harmonic oscillator coupled with an artificially engineered reservoir. We single out the reservoir and system variables governing the passage between Lindblad type and non-Lindblad type dynamics of the reduced system's oscillator. We demonstrate the existence of conditions under which virtual exchanges of energy between system and reservoir take place. We propose to use a single trapped ion coupled to engineered reservoirs in order to simulate quantum Brownian motion.
We propose an efficient scheme for simulating the Lipkin-Meshkov-Glick (LMG) model with nitrogen-vacancy (NV) center ensembles in diamond magnetically coupled to superconducting coplanar waveguide cavities. With the assistance of external microwave driving fields, we show that the interaction of the NV spins can be easily controlled, and several types of the LMG model can be realized by tuning the different parameters. Under the thermal dynamical limit, the distinct non-equilibrium second order quantum phase transition of the spin ensemble can be achieved at the critical point. Furthermore, we…
Studying out-of-equilibrium physics in quantum systems under quantum quench is of vast experimental and theoretical interests. Using periodic quantum quenches, we present an experimentally accessible scheme to simulate the quantum Zeno and anti-Zeno effects in an open quantum system of a single superconducting qubit interacting with an array of transmission line resonators. The scheme is based on the following two observations: Firstly, compared with conventional systems, the short-time non-exponential decay in our superconducting circuit system is readily observed; and secondly, a quench-off …
The variational quantum eigensolver (VQE) is one of the most appealing quantum algorithms to simulate electronic structure properties of molecules on near-term noisy intermediate-scale quantum devices. In this work, we generalize the VQE algorithm for simulating extended systems. However, the numerical study of an one-dimensional (1D) infinite hydrogen chain using existing VQE algorithms shows a remarkable deviation of the ground state energy with respect to the exact full configuration interaction (FCI) result. Here, we present two schemes to improve the accuracy of quantum simulations for ex…
Accurate quantum chemistry simulations remain challenging on classical computers for problems of industrially relevant sizes and there is reason for hope that quantum computing may help push the boundaries of what is technically feasible. While variational quantum eigensolver (VQE) algorithms may already turn noisy intermediate scale quantum (NISQ) devices into useful machines, one has to make all efforts to use the scarce quantum resources as efficiently as possible. We combine the so-called seniority-zero, or paired-electron, approximation of computational quantum chemistry with techniques f…
Verification of NISQ era quantum devices demands fast classical simulation of large noisy quantum circuits. We present an algorithm based on the stabilizer formalism that can efficiently simulate noisy stabilizer circuits. Additionally, the protocol can efficiently simulate a large set of multi-qubit mixed states that are not mixtures of stabilizer states. The existence of these 'bound states' was previously only known for odd-dimensional systems like qutrits. The algorithm also has the favorable property that circuits with depolarizing noise are simulated much faster than unitary circuits. Th…
Assume Alice and Bob share some bipartite $d$-dimensional quantum state. A well-known result in quantum mechanics says that by performing two-outcome measurements, Alice and Bob can produce correlations that cannot be obtained locally, i.e., with shared randomness alone. We show that by using only two bits of communication, Alice and Bob can classically simulate any such correlations. All previous protocols for exact simulation required the communication to grow to infinity with the dimension $d$. Our protocol and analysis are based on a power series method, resembling Krivine's bound on Groth…
Many developing quantum technologies make use of quantum networks of different types. Even linear quantum networks are nontrivial, as the output photon distributions can be exponentially complex. Despite this, they can still be computationally simulated. The methods used are transformations into equivalent phase-space representations, which can then be treated probabilistically. This provides an exceptionally useful tool for the prediction and validation of experimental results, including decoherence. As well as experiments in Gaussian boson sampling, which are intended to demonstrate quantum …
An analog of classical "hidden variables" for qubit states is presented. The states of qubit (two-level atom, spin-1/2 particle) are mapped onto the states of three classical--like coins. The bijective map of the states corresponds to the presence of correlations of random classical--like variables associated with the coin positions "up" or "down" and the observables are mapped onto quantum observables described by Hermitian matrices. The connection of the classical--coin statistics with the statistical properties of qubits is found.
