Digital Quantum Simulation Research Articles

Optimal compression of quantum many-body time evolution operators into brickwall circuits

Near term quantum computers suffer from a degree of decoherence which is prohibitive for high fidelity simulations with deep circuits. An economical use of circuit depth is therefore paramount. For digital quantum simulation of quantum many-body systems, real time evolution is typically achieved by a Trotter decomposition of the time evolution operator into circuits consisting only of two qubit gates. To match the geometry of the physical system and the CNOT connectivity of the quantum processor, additional SWAP gates are needed. We show that optimal fidelity, beyond what is achievable by simple Trotter decompositions for a fixed gate count, can be obtained by compiling the evolution operator into optimal brickwall circuits for the S=1/2S=1/2 quantum Heisenberg model on chains and ladders, when mapped to one dimensional quantum processors without the need of additional SWAP gates.

Preparing valence-bond-solid states on noisy intermediate-scale quantum computers

Quantum state preparation is a key step in all digital quantum simulation algorithms. Here we propose methods to initialize on a gate-based quantum computer a general class of quantum spin wave functions, the so-called valence-bond-solid (VBS) states, that are important for two reasons. First, VBS states are the exact ground states of a class of interacting quantum spin models introduced by Affleck, Kennedy, Lieb, and Tasaki (AKLT). Second, the two-dimensional VBS states are universal resource states for measurement-based quantum computing. We find that schemes to prepare VBS states based on their tensor-network representations yield quantum circuits that are too deep to be within reach of noisy intermediate-scale quantum (NISQ) computers. We then apply the general nondeterministic method herein proposed to the preparation of the spin-1 and spin-$3/2$ VBS states, the ground states of the AKLT models defined in one dimension and in the honeycomb lattice, respectively. Shallow quantum circuits of depth independent of the lattice size are explicitly derived for both cases, making use of optimization schemes that outperform standard basis gate decomposition methods. The probabilistic nature of the proposed routine translates into an average number of repetitions to successfully prepare the VBS state that scales exponentially with the number of lattice sites $N$. However, two strategies to quadratically reduce this repetition overhead for any bipartite lattice are devised. Our approach should permit to use NISQ processors to explore the AKLT model and variants thereof, outperforming conventional numerical methods in the near future.

Iteration-free digital quantum simulation of imaginary-time evolution based on the approximate unitary expansion

Imaginary-time evolution plays an important role in many areas of quantum physics and has been widely applied to the ground-state determination of various Hamiltonian in the quantum computation field. In this work, we propose an iteration-free quantum algorithm in a full gate-based frame using the approximate unitary expansion to simulate the imaginary-time evolution operator, avoiding the resource overhead caused by repeated measurement for state reconstruction or complex pre-calculations in the classical computers. We detail the algorithm and analyze the complexity and related characteristics including a lower bound for ancillary qubits at a given success probability. Then an application demonstration of the algorithm in quantum chemistry with hydrogen molecule under noiseless and noisy conditions is offered. In addition, we present another imaginary-time evolution simulation method based on similar construction schemes. Our algorithms can serve as the alternative proposals for the imaginary-time evolution realization in the future fault-tolerant quantum computers.

Digital quantum simulation of quantum gravitational entanglement with IBM quantum computers

We report the digital quantum simulation of a hamiltonian involved in the generation of quantum entanglement by gravitational means. In particular, we focus on a pair of quantum harmonic oscillators, whose interaction via a quantum gravitational field generates single-mode squeezing in both modes at the same time, a non-standard process in quantum optics. We perform a boson-qubit mapping and a digital gate decomposition specific for IBM quantum devices. We use error mitigation and post-selection to achieve high-fidelity, accessing a parameter regime out of direct experimental reach.

Binary-coupling sparse Sachdev-Ye-Kitaev model: An improved model of quantum chaos and holography

The sparse version of the Sachdev-Ye-Kitaev (SYK) model reproduces essential features of the original SYK model while reducing the number of disorder parameters. In this paper, we propose a further simplification of the model which we call the binary-coupling sparse SYK model. We set the nonzero couplings to be $\pm 1$, rather than being sampled from a continuous distribution such as Gaussian. Remarkably, this simplification turns out to be an improvement: the binary-coupling model exhibits strong correlations in the spectrum, which is the important feature of the original SYK model that leads to the quick onset of the random-matrix universality, more efficiently in terms of the number of nonzero terms. This model is better suited for analog or digital quantum simulations of quantum chaotic behavior and holographic metals due to its simplicity and scaling properties.

Kernel-based quantum regressor models learning non-Markovianity

Quantum machine learning is a growing research field that aims to perform machine learning tasks assisted by a quantum computer. Kernel-based quantum machine learning models are paradigmatic examples where the kernel involves quantum states, and the Gram matrix is calculated from the overlap between these states. With the kernel at hand, a regular machine learning model is used for the learning process. In this paper we investigate the quantum support vector machine and quantum kernel ridge models to predict the degree of non-Markovianity of a quantum system. We perform digital quantum simulation of amplitude damping and phase damping channels to create our quantum dataset. We elaborate on different kernel functions to map the data and kernel circuits to compute the overlap between quantum states. We show that our models deliver accurate predictions that are comparable with the fully classical models.

A quantum simulator based on locally controlled logical systems

In a digital quantum simulator, basic two-qubit interactions are manipulated by means of fast local control operations to establish a desired target Hamiltonian. Here we consider a quantum simulator based on logical systems, i.e. where several physical qubits are used to represent a single logical two-level system to obtain enhanced and simple control over effective interactions between logical systems. Fixed, distance-dependent pairwise interactions between the physical qubits lead to effective interactions between the logical systems, which can be fully controlled solely by the choice of their internal state. This allows one to directly manipulate the topology and strength of effective interactions between logical systems. We show how to choose and generate the required states of logical systems for any desired interaction pattern and topology, how to perform arbitrary logical measurements, and how to obtain full control over single logical systems using only the intrinsic two-body interactions and control of individual physical qubits. This leads to a universal quantum simulator based on logical systems. We discuss the advantages of such a logical quantum simulator over standard ones, including the possibility to reach target topologies that are only accessible with large overheads otherwise. We provide several examples of how to obtain different target interaction patterns and topologies from initial long-ranged or short-ranged qubit-qubit interactions with a specific distance dependence.

Symmetric Trotterization in digital quantum simulation of quantum spin dynamics

Symmetric Trotterization in digital quantum simulation of quantum spin dynamics

Hamiltonian Simulation with Random Inputs.

The algorithmic error of digital quantum simulations is usually explored in terms of the spectral norm distance between the actual and ideal evolution operators. In practice, this worst-case error analysis may be unnecessarily pessimistic. To address this, we develop a theory of average-case performance of Hamiltonian simulation with random initial states. We relate the average-case error to the Frobenius norm of the multiplicative error and give upper bounds for the product formula (PF) and truncated Taylor series methods. As applications, we estimate average-case error for the digital Hamiltonian simulation of general lattice Hamiltonians and k-local Hamiltonians. In particular, for the nearest-neighbor Heisenberg chain with n spins, the error is quadratically reduced from O(n) in the worst case to O(sqrt[n]) on average for both the PF method and the Taylor series method. Numerical evidence suggests that this theory accurately characterizes the average error for concrete models. We also apply our results to error analysis in the simulation of quantum scrambling.

Digital quantum simulation of an extended Agassi model: Using machine learning to disentangle its phase-diagram

A digital quantum simulation for the extended Agassi model is proposed using a quantum platform with eight trapped ions. The extended Agassi model is an analytically solvable model including both short range pairing and long range monopole-monopole interactions with applications in nuclear physics and in other many-body systems. In addition, it owns a rich phase diagram with different phases and the corresponding phase transition surfaces. The aim of this work is twofold: on one hand, to propose a quantum simulation of the model at the present limits of the trapped ions facilities and, on the other hand, to show how to use a machine learning algorithm on top of the quantum simulation to accurately determine the phase of the system. Concerning the quantum simulation, this proposal is scalable with polynomial resources to larger Agassi systems. Digital quantum simulations of nuclear physics models assisted by machine learning may enable one to outperform the fastest classical computers in determining fundamental aspects of nuclear matter.

Towards string order melting of spin-1 particle chains in superconducting transmons using optimal control

Utilizing optimal control to simulate a model Hamiltonian is an emerging strategy that leverages the intrinsic physics of a device with digital quantum simulation methods. Here we evaluate optimal control for probing the nonequilibrium properties of symmetry-protected topological (SPT) states simulated with superconducting hardware. Assuming a tunable transmon architecture, we cast the evolution of these SPT states as a series of one- and two-site pulse optimization problems that are solved in the presence of leakage constraints. From the generated pulses, we classically simulate the time-dependent melting of the perturbed SPT string order across a six-site model with an average state infidelity of ${10}^{\ensuremath{-}3}$. The feasibility of these pulses as well as their efficient application indicate that high-fidelity simulations of string order melting are within reach of current quantum computing systems.

Random Quantum Circuits

Quantum circuits—built from local unitary gates and local measurements—are a new playground for quantum many-body physics and a tractable setting to explore universal collective phenomena far from equilibrium. These models have shed light on longstanding questions about thermalization and chaos, and on the underlying universal dynamics of quantum information and entanglement. In addition, such models generate new sets of questions and give rise to phenomena with no traditional analog, such as dynamical phase transitions in quantum systems that are monitored by an external observer. Quantum circuit dynamics is also topical in view of experimental progress in building digital quantum simulators that allow control of precisely these ingredients. Randomness in the circuit elements allows a high level of theoretical control, with a key theme being mappings between real-time quantum dynamics and effective classical lattice models or dynamical processes. Many of the universal phenomena that can be identified in this tractable setting apply to much wider classes of more structured many-body dynamics.

Primitive quantum gates for an SU(2) discrete subgroup: Binary tetrahedral

We construct a primitive gate set for the digital quantum simulation of the binary tetrahedral ($\mathbb{BT}$) group on two quantum architectures. This non-Abelian discrete group serves as a crude approximation to $SU(2)$ lattice gauge theory while requiring five qubits or one quicosotetrit per gauge link. The necessary basic primitives are the inversion gate, the group multiplication gate, the trace gate, and the $\mathbb{BT}$ Fourier transform over $\mathbb{BT}$. We experimentally benchmark the inversion and trace gates on ibm_nairobi, with estimated fidelities between 14%--55%, depending on the input state.

Towards Quantum Control with Advanced Quantum Computing: A Perspective.

We propose the combination of digital quantum simulation and variational quantum algorithms as an alternative approach to numerical methods for solving quantum control problems. As a hybrid quantum-classical framework, it provides an efficient simulation of quantum dynamics compared to classical algorithms, exploiting the previous achievements in digital quantum simulation. We analyze the trainability and the performance of such algorithms based on our preliminary works. We show that specific quantum control problems, e.g., finding the switching time for bang-bang control or the digital quantum annealing schedule, can already be studied in the noisy intermediate-scale quantum era. We foresee that these algorithms will contribute even more to quantum control of high precision if the hardware for experimental implementation is developed to the next level.

Error-mitigated deep-circuit quantum simulation of open systems: Steady state and relaxation rate problems

Deep-circuit quantum computation, like Shor's algorithm, is undermined by error accumulation, and near-future quantum techniques are far from adequate for full-fledged quantum error correction. Instead of resorting to shallow-circuit quantum algorithms, recent theoretical research suggests that digital quantum simulation (DQS) of closed quantum systems are robust against the accumulation of Trotter errors, as long as local observables are concerned. In this paper, we investigate digital quantum simulation of open quantum systems. First, we prove that the deviation in the steady state obtained from digital quantum simulation depends only on the error in a single Trotter step, which indicates that error accumulation may not be disastrous. By numerical simulation of the quantum circuits for the DQS of the dissipative XYZ model, we then show that the correct results can be recovered by quantum error mitigation as long as the error rate in the DQS is below a sharp threshold. We explain this threshold behavior by the existence of a dissipation-driven quantum phase transition. Finally, we propose a new error-mitigation technique based on the scaling behavior in the vicinity of the critical point of a quantum phase transition. Our results expand the territory of near-future available quantum algorithms and stimulate further theoretical and experimental efforts in practical quantum applications.

Digital Quantum Simulation and Circuit Learning for the Generation of Coherent States.

Coherent states, known as displaced vacuum states, play an important role in quantum information processing, quantum machine learning, and quantum optics. In this article, two ways to digitally prepare coherent states in quantum circuits are introduced. First, we construct the displacement operator by decomposing it into Pauli matrices via ladder operators, i.e., creation and annihilation operators. The high fidelity of the digitally generated coherent states is verified compared with the Poissonian distribution in Fock space. Secondly, by using Variational Quantum Algorithms, we choose different ansatzes to generate coherent states. The quantum resources-such as numbers of quantum gates, layers and iterations-are analyzed for quantum circuit learning. The simulation results show that quantum circuit learning can provide high fidelity on learning coherent states by choosing appropriate ansatzes.

Zoo of silicon-based quantum bits

Zoo of silicon-based quantum bits

Propagation of errors and quantitative quantum simulation with quantum advantage

The rapid development in hardware for quantum computing and simulation has led to much interest in problems where these devices can exceed the capabilities of existing classical computers and known methods. Approaching this for problems that go beyond testing the performance of a quantum device is an important step, and quantum simulation of many-body quench dynamics is one of the most promising candidates for early practical quantum advantage. We analyse the requirements for quantitatively reliable quantum simulation beyond the capabilities of existing classical methods for analogue quantum simulators with neutral atoms in optical lattices and trapped ions. Considering the primary sources of error in analogue devices and how they propagate after a quench in studies of the Hubbard or long-range transverse field Ising model, we identify the level of error expected in quantities we extract from experiments. We conclude for models that are directly implementable that regimes of practical quantum advantage are attained in current experiments with analogue simulators. We also identify the hardware requirements to reach the same level of accuracy with future fault-tolerant digital quantum simulation. Verification techniques are already available to test the assumptions we make here, and demonstrating these in experiments will be an important next step.

Quantum simulation of chiral phase transitions

The Nambu–Jona-Lasinio (NJL) model has been widely studied for investigating the chiral phase structure of strongly interacting matter. The study of the thermodynamics of field theories within the framework of Lattice Field Theory is limited by the sign problem, which prevents Monte Carlo evaluation of the functional integral at a finite chemical potential. Using the quantum imaginary time evolution (QITE) algorithm, we construct a quantum simulation for the (1 + 1) dimensional NJL model at finite temperature and finite chemical potential. We observe consistency among digital quantum simulation, exact diagonalization and analytical solution, indicating further applications of quantum computing in simulating QCD thermodynamics.

Digital quantum simulation, learning of the Floquet Hamiltonian, and quantum chaos of the kicked top

The kicked top is one of the paradigmatic models in the study of quantum chaos (Haake et al 2018 Quantum Signatures of Chaos (Springer Series in Synergetics vol 54)). Recently it has been shown that the onset of quantum chaos in the kicked top can be related to the proliferation of Trotter errors in digital quantum simulation (DQS) of collective spin systems. Specifically, the proliferation of Trotter errors becomes manifest in expectation values of few-body observables strongly deviating from the target dynamics above a critical Trotter step, where the spectral statistics of the Floquet operator of the kicked top can be predicted by random matrix theory. In this work, we study these phenomena in the framework of Hamiltonian learning (HL). We show how a recently developed HL protocol can be employed to reconstruct the generator of the stroboscopic dynamics, i.e., the Floquet Hamiltonian, of the kicked top. We further show how the proliferation of Trotter errors is revealed by HL as the transition to a regime in which the dynamics cannot be approximately described by a low-order truncation of the Floquet–Magnus expansion. This opens up new experimental possibilities for the analysis of Trotter errors on the level of the generator of the implemented dynamics, that can be generalized to the DQS of quantum many-body systems in a scalable way. This paper is in memory of our colleague and friend Fritz Haake.