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 discussed models for a very wide range of parameters. The time needed to simulate the Hamiltonian is estimated and the accuracy of the simulation process is numerically investigated for small systems.
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…
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…
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…
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 analytically evaluate the entanglement spectra of the superconductivity states in graphene, primarily focusing on the s-wave and chiral $ d_{x^{2}-y^{2}}+id_{xy} $ superconductivity states. We demonstrate that the topology of the entanglement Hamiltonian can differ from that of the subsystem Hamiltonian. In particular, the topological properties of the entanglement Hamiltonian of the chiral $ d_{x^{2}-y^{2}}+id_{xy} $ superconductivity state obtained by tracing out one spin direction clearly differ from those of the time-reversal invariant Hamiltonian of noninteracting fermions on the honey…
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…
Simulating Hamiltonian dynamics is one of the most fundamental and significant tasks for characterising quantum materials. Recently, a series of quantum algorithms employing block-encoding of Hamiltonians have succeeded in providing efficient simulation of time-evolution operators on quantum computers. While time-independent Hamiltonians can be simulated by the quantum eigenvalue transformation (QET) or quantum singularvalue transformation with the optimal query complexity in time $t$ and desirable accuracy $\varepsilon$, generic time-dependent Hamiltonians face at larger query complexity and …
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 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 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…
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…
In the last two decades there have been tremendous attempts to built an adequate theory of high-temperature superconductivity. Most studies (including our efforts) used some model Hamiltonians with input parameters not directly related to the material. The dielectric response function of electrons in strongly correlated high-temperature superconductors is apriori unknown. Hence one has to start with the generic Hamiltonian including unscreened Coulomb and Froehlich electron-phonon interactions operating on the same scale since any ad-hoc assumption on their range and relative magnitude might f…
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…
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 …
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 …
Using the standard Hamiltonian of the BCS theory, we show that in an ensemble of interacting fermions there exists a coherent state $|NC>$, which nullifies the Hamiltonian of the interparticle interaction. This state has an analogy with the well-known in quantum optics coherent population trapping effect (CPT). A possible application of such CPT-like states in the superconductivity theory is discussed.
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.
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…
We show that lattice systems, such as the Bose-Hubbard model, can be simulated on a single nano- or micro-mechanical resonator, by exploiting its many modes. The on-site Hamiltonians are engineered by coupling the mechanical modes to the modes of a pair of optical or stripline resonators, and the connections between the lattice sites are engineered in a similar way. The lattice network structure is encoded in the frequency components of the fields driving the resonators. This three-resonator configuration also allows universal quantum computing on the nano-resonator.
