We use an n-spin system with permutation symmetric zz-interaction for simulating arbitrary pair-interaction Hamiltonians. The calculation of the required time overhead is mathematically equivalent to a separability problem of n-qubit density matrices. We derive lower and upper bounds in terms of chromatic index and the spectrum of the interaction graph. The complexity measure defined by such a computational model is related to gate complexity and a continuous complexity measure introduced in a former paper. We use majorization of graph spectra for classifying Hamiltonians with respect to their computational power.
We provide a general method for efficiently simulating time-dependent Hamiltonian dynamics on a circuit-model based quantum computer. Our approach is based on approximating the truncated Dyson series of the evolution operator, extending the earlier proposal by Berry to evolution generated by explicitly time-dependent Hamiltonians. Two alternative strategies are proposed to implement time ordering while exploiting the superposition principle for sampling the Hamiltonian at different times. The resource cost of our simulation algorithm retains the optimal logarithmic dependence on the inverse of…
By embedding a $\cal PT$-symmetric (pseudo-Hermitian) system into a large Hermitian one, we disclose the relations between $\cal{PT}$-symmetric Hamiltonians and weak measurement theory. We show that the amplification effect in weak measurement on a conventional quantum system can be used to effectively simulate a local broken $\cal PT$-symmetric Hamiltonian system, with the pre-selected state in the $\cal PT$-symmetric Hamiltonian system and its post-selected state resident in the dilated Hamiltonian system.
We present an efficient algorithm for simulating the time evolution due to a sparse Hamiltonian. In terms of the maximum degree d and dimension N of the space on which the Hamiltonian H acts for time t, this algorithm uses (d^2(d+log* N)||Ht||)^{1+o(1)} queries. This improves the complexity of the sparse Hamiltonian simulation algorithm of Berry, Ahokas, Cleve, and Sanders, which scales like (d^4(log* N)||Ht||)^{1+o(1)}. To achieve this, we decompose a general sparse Hamiltonian into a small sum of Hamiltonians whose graphs of non-zero entries have the property that every connected component i…
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 describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of physical systems. As in another recent algorithm, the cost of our method depends only logarithmically on the inverse of the desired precision, which is optimal. However, we simplify the algorithm and its analysis by using a method for implementing linear combinations of unitary operations to directly apply the truncated Taylor series.
When can a quantum system of finite dimension be used to simulate another quantum system of finite dimension? What restricts the capacity of one system to simulate another? In this paper we complete the program of studying what simulations can be done with entangling many-qudit Hamiltonians and local unitary control. By entangling we mean that every qudit is coupled to every other qudit, at least indirectly. We demonstrate that the only class of finite-dimensional entangling Hamiltonians that aren't universal for simulation is the class of entangling Hamiltonians on qubits whose Pauli operator…
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.
The need for Hamiltonians with many-body interactions arises in various applications of quantum computing. However, interactions beyond two-body are difficult to realize experimentally. Perturbative gadgets were introduced to obtain arbitrary many-body effective interactions using Hamiltonians with two-body interactions only. Although valid for arbitrary $k$-body interactions, their use is limited to small $k$ because the strength of interaction is $k$'th order in perturbation theory. In this paper we develop a nonperturbative technique for obtaining effective $k$-body interactions using Hamil…
We develop a framework and give an example for situations where two distinct Hamiltonians living in the same Hilbert space can be used to simulate the same physics. As an example of an analog simulation, we first discuss how one can simulate an infinite-range-interaction one-axis twisting Hamiltonian using a short-range nearest-neighbor-interaction Heisenberg XXX model with a staggered field. Based on this, we show how one can build an alternative version of a digital quantum simulator. As a by-product, we present a method for creating many-body maximally entangled states using only short-rang…
We study the time evolution of the amount of entanglement generated by one dimensional spin-1/2 Ising-type Hamiltonians composed of many-body interactions. We investigate sets of states randomly selected during the time evolution generated by several types of time-independent Hamiltonians by analyzing the distributions of the amount of entanglement of the sets. We compare such entanglement distributions with that of typical entanglement, entanglement of a set of states randomly selected from a Hilbert space with respect to the unitarily invariant measure. We show that the entanglement distribu…
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…
Simulating physical systems has been an important application of classical and quantum computers. In this article we present an efficient classical algorithm for simulating time-dependent quantum mechanical Hamiltonians over constant periods of time. The algorithm presented here computes the mean value of an observable over the output state of such short-time Hamiltonian evolutions. In proving the performance of this algorithm we use Lieb-Robinson type bounds to limit the evolution of local operators within a lightcone. This allows us to divide the task of simulating a large quantum system int…
We present a low-space overhead simulation algorithm based on the truncated Dyson series for time-dependent quantum dynamics. This algorithm is applied to simulating time-independent Hamiltonians by transitioning to the interaction picture, where some portions are made time-dependent. This can provide a favorable complexity trade-off as the algorithm scales exponentially better with derivatives of the time-dependent component than the original Hamiltonian. We show that this leads to an exponential improvement in gate complexity for simulating some classes of diagonally dominant Hamiltonian. Ad…
The incoherent dynamical properties of open quantum systems are generically attributed to an ongoing correlation between the system and its environment. Here, we propose a novel way to assess the nature of these system-environment correlations by examining the system dynamics alone. Our approach is based on the possibility or impossibility to simulate open-system dynamics with Hamiltonian ensembles. As we show, such (im)possibility to simulate is closely linked to the system-environment correlations. We thus define the nonclassicality of open-system dynamics in terms of the nonexistence of a H…
The one-dimensional Ising model with its connections to several physical concepts plays a vital role in comprehension of several principles, phenomena and numerical methods. The Hamiltonian of a coupled one-dimensional dissipative spin system in the presence of magnetic field can be obtained from the Ising model. We simulate the above Hamiltonian by designing a quantum circuit with precise gate measurement and execute with the IBMQ experience platform through different $N$ states with controlled energy separation where we can check quantum synchronization in a dissipative lattice system. Our r…
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.
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 study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local interactions (i.e., a qubit may only interact with qubits in its vicinity). This class of Hamiltonians is very general and is believed to capture fundamental interactions of physics. Our algorithm simulates the time evolution of such a Hamiltonian on $n$ qubits for time $T$ up to error $ε$ using $\mathcal O( nT \mathrm{polylog} (nT/ε))$ gates with depth $\mathcal O(T \mathrm{polylog} (nT/ε))$. Our algorithm is the first…
We provide a quantum algorithm for simulating the dynamics of sparse Hamiltonians with complexity sublogarithmic in the inverse error, an exponential improvement over previous methods. Specifically, we show that a $d$-sparse Hamiltonian $H$ acting on $n$ qubits can be simulated for time $t$ with precision $ε$ using $O\big(τ\frac{\log(τ/ε)}{\log\log(τ/ε)}\big)$ queries and $O\big(τ\frac{\log^2(τ/ε)}{\log\log(τ/ε)}n\big)$ additional 2-qubit gates, where $τ= d^2 \|{H}\|_{\max} t$. Unlike previous approaches based on product formulas, the query complexity is independent of the number of qubits act…
We examine the problem of simulating lattice gauge theories on a universal quantum computer. The basic strategy of our approach is to transcribe lattice gauge theories in the Hamiltonian formulation into a Hamiltonian involving only Pauli spin operators such that the simulation can be performed on a quantum computer using only one and two qubit manipulations. We examine three models, the U(1), SU(2), and SU(3) lattice gauge theories which are transcribed into a spin Hamiltonian up to a cutoff in the Hilbert space of the gauge fields on the lattice. The number of qubits required for storing a p…
We investigate the feasibility of simulating different model Hamiltonians used in high-temperature superconductivity. We briefly discuss the most common models and then focus on the simulation of the so-called t-J-U Hamiltonian using ultra-cold atoms in optical lattices. For this purpose, previous simulation schemes to realize the spin interaction term J are extended. We especially overcome the condition of a filling factor of exactly one, which otherwise would restrict the phase of the simulated system to a Mott-insulator. Using ultra-cold atoms in optical lattices allows simulation of the di…
Linear canonical transformations of bosonic modes correspond to Gaussian unitaries, which comprise passive linear-optical transformations as effected by a multiport passive interferometer and active Bogoliubov transformations as effected by a nonlinear amplification medium. As a consequence of the Bloch-Messiah theorem, any Gaussian unitary can be decomposed into a passive interferometer followed by a layer of single-mode squeezers and another passive interferometer. Here, it is shown how to circumvent the need for active transformations. Namely, we provide a technique to simulate sampling fro…
In previous papers we have considered mutual simulation of n-partite pair-interaction Hamiltonians. We have focussed on the running time overhead of general simulations, while considering the required number of time steps only for special cases (decoupling and time-reversal). These two complexity measures differ significantly. Here we derive lower bounds on the number of time steps for general simulations. In particular, the simulation of interaction graphs with irrational spectrum requires at least n steps. We discuss as examples graphs that correspond to graph codes and nearest neighbor inte…
We present a quantum algorithm for simulating the dynamics of Hamiltonians that are not necessarily sparse. Our algorithm is based on the input model where the entries of the Hamiltonian are stored in a data structure in a quantum random access memory (qRAM) which allows for the efficient preparation of states that encode the rows of the Hamiltonian. We use a linear combination of quantum walks to achieve poly-logarithmic dependence on precision. The time complexity of our algorithm, measured in terms of the circuit depth, is $O(t\sqrt{N}\|H\|\,\mathrm{polylog}(N, t\|H\|, 1/ε))$, where $t$ is …
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.
Controlling the interaction graph between spins or qubits in a quantum simulator allows user-controlled tailoring of native interactions to achieve a target Hamiltonian. The flexibility of engineering long-ranged phonon-mediated spin-spin interactions in a trapped ion quantum simulator offers such a possibility. Trapped ions, a leading candidate for simulating computationally hard quantum many-body dynamics, are most readily trapped in a linear 1D chain, limiting their utility for readily simulating higher dimensional spin models. In this work, we introduce a hybrid method of analog-digital si…
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are significant because they are the first to have time-complexities that are comparable to the best known methods for simulating time-independent Hamiltonian evolution, given appropriate smoothness criteria on the Hamiltonian are satisfied. We provide a thorough cost analysis of these algorithms that considers discretizion errors in both the time and the represen…
We describe methods for simulating general second-quantized Hamiltonians using the compact encoding, in which qubit states encode only the occupied modes in physical occupation number basis states. These methods apply to second-quantized Hamiltonians composed of a constant number of interactions, i.e., linear combinations of ladder operator monomials of fixed form. Compact encoding leads to qubit requirements that are optimal up to logarithmic factors. We show how to use sparse Hamiltonian simulation methods for second-quantized Hamiltonians in compact encoding, give explicit implementations f…
The coherent Ising machine (CIM) enables efficient sampling of low-lying energy states of the Ising Hamiltonian with all-to-all connectivity by encoding the spins in the amplitudes of pulsed modes in an optical parametric oscillator (OPO). The interaction between the pulses is realized by means of measurement-based optoelectronic feedforward which enhances the gain for lower-energy spin configurations. We present an efficient method of simulating the CIM on a classical computer that outperforms the CIM itself as well as the noisy mean-field annealer in terms of both the quality of the samples …
Simulating Hamiltonian dynamics in a programmable photonic quantum processor using linear combinations of unitary operations
State Key Laboratory for Mesoscopic Physics, School of Physics, Peking University（北京大学物理学院介观物理国家重点实验室）；Frontiers Science Center for Nano-optoelectronics & Collaborative Innovation Center of Quantum Matter, Peking University（北京大学纳米光子学与光电子前沿科学中心及量子物质协同创新中心）；Collaborative Innovation Center of Extreme Optics, Shanxi University（山西大学极端光学协同创新中心）；Peking University Yangtze Delta Institute of Optoelectronics（北京大学长三角光电科学研究院）；Hefei National Laboratory（合肥国家实验室）
Simulating high-weight Hamiltonians can convert local noise on the original Hamiltonian into undesirable nonlocal noise on the simulated Hamiltonian. Here we show how starting from two-local Hamiltonian in the presence of non-Markovian noise, a desired computation can be simulated as well as protected using fast pulses, while maintaining an energy gap against the errors created in the process.
Simulating quantum circuits with arbitrary local noise using Pauli Propagation
Ecole Polytechnique Fédérale de Lausanne (EPFL)（洛桑联邦理工学院）；Freie Universität Berlin（柏林自由大学）；Dahlem Center for Complex Quantum Systems, Freie Universität Berlin（柏林自由大学达勒姆复杂量子系统中心）；Los Alamos National Laboratory（洛斯阿拉莫斯国家实验室）
We present general methods for simulating black-box Hamiltonians using quantum walks. These techniques have two main applications: simulating sparse Hamiltonians and implementing black-box unitary operations. In particular, we give the best known simulation of sparse Hamiltonians with constant precision. Our method has complexity linear in both the sparseness D (the maximum number of nonzero elements in a column) and the evolution time t, whereas previous methods had complexity scaling as D^4 and were superlinear in t. We also consider the task of implementing an arbitrary unitary operation gi…
In this thesis, I investigate aspects of local Hamiltonians in quantum computing. First, I focus on the Adiabatic Quantum Computing model, based on evolution with a time dependent Hamiltonian. I show that to succeed using AQC, the Hamiltonian involved must have local structure, which leads to a result about eigenvalue gaps from information theory. I also improve results about simulating quantum circuits with AQC. Second, I look at classically simulating time evolution with local Hamiltonians and finding their ground state properties. I give a numerical method for finding the ground state of tr…
Dirac particle represents a fundamental constituent of our nature. Simulation of Dirac particle dynamics by a controllable quantum system using quantum walks will allow us to investigate the non-classical nature of dynamics in its discrete form. In this work, starting from a modified version of one-spatial dimensional general inhomogeneous split-step discrete quantum walk we derive an effective Hamiltonian which mimics a single massive Dirac particle dynamics in curved $(1+1)$ space-time dimension coupled to $U(1)$ gauge potential---which is a forward step towards the simulation of the unifica…
We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number of exponentials required to approximate $e^{-iHt}$ with error $\e$. Moreover, we derive the order of the splitting method that optimizes the cost of the resulting algorithm. We show significant speedups relative to previously known results.
Analytically Exact Quantum Simulation of N-Body Interactions via Untunable Decentralized Hamiltonians for Implementing the Toric Code and Its Modifications
提出一种解析精确的量子模拟方法，通过迭代附加二体相互作用模拟 N 体相互作用，并应用于环面码及其变体的模拟，解决拓扑量子计算中的关键障碍。
Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. Here we consider methods to make proposed chemical simulation algorithms computationally fast on fault-tolerant quantum computers in the circuit model. Fault tolerance constrains the choice of available gates, so that arbitrary gates required for a simulation algorithm must be constructed from sequences of fundamental operations. We examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the …
Hybrid quantum-classical algorithms have been proposed to circumvent noise limitations in quantum computers. Such algorithms delegate only a calculation of the expectation value to the quantum computer. Among them, the Variational Quantum Eigensolver (VQE) has been implemented to study molecules and condensed matter systems on small size quantum computers. Condensed matter systems described by the Hubbard model exhibit a rich phase diagram alongside exotic states of matter. In this manuscript, we try to answer the question: how much of the underlying physics of a 1D Hubbard chain is described …
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…
Matrix exponentiation (ME) is widely used in various fields of science and engineering. For example, the unitary dynamics of quantum systems is described by exponentiation of Hamiltonian operators. However, despite a significant attention, the numerical evaluation of ME remains computationally expensive, particularly for large dimensions. Often this process becomes a bottleneck in algorithms requiring iterative evaluation of ME. Here we propose a method for approximating ME of a single operator with a bounded coefficient into a product of certain discrete operators. This approach, which we ref…
In the limit of large quantum excitations, the classical and quantum probability distributions for a Schrödinger equation can be compared by using the corresponding WKBJ solutions whose rapid oscillations are averaged. This result is extended for one-dimensional Hamiltonians with a non-usual kinetic part. The validity of the approach is tested with a Hamiltonian containing a relativistic kinetic energy operator.
We provide a quantum method for simulating Hamiltonian evolution with complexity polynomial in the logarithm of the inverse error. This is an exponential improvement over existing methods for Hamiltonian simulation. In addition, its scaling with respect to time is close to linear, and its scaling with respect to the time derivative of the Hamiltonian is logarithmic. These scalings improve upon most existing methods. Our method is to use a compressed Lie-Trotter formula, based on recent ideas for efficient discrete-time simulations of continuous-time quantum query algorithms.
