PaperlayerView exact revision on arXiv

Source-linked AI summary

Quantum computers as universal quantum simulators: state-of-art and perspectives

Francesco Tacchino, Alessandro Chiesa, Stefano Carretta, Dario Gerace

arXiv:1907.03505v2quant-ph

TL;DR

Classical simulation of quantum dynamics becomes resource-intensive as the system’s Hilbert space grows. This review surveys digital quantum simulation theory and experiments on trapped-ion and superconducting platforms, finding that achievable simulations remain limited in fidelity and scale.

  • Problem

    Simulating quantum systems can require exponentially more classical time and memory as the number of subsystems grows.

    Source: §II · p. 3

  • Method

    The review presents digital quantum simulation theory and surveys experimental spin-model simulations, focusing on trapped-ion and superconducting platforms.

    Source: §I · pp. 2–3

  • Results

    Across platforms, fidelity is correlated with digital-step count; 5 Trotter steps limit superconducting simulations to slightly above 60% fidelity, while spin models reach 6 spins on ions and 4 on superconducting circuits.

    Source: §IV · p. 14

  • Takeaways & Limitations

    Quantum advantage for complex many-body simulation remains a future goal for NISQ hardware with a few tens of non-error-corrected qubits.

    Source: §V · p. 22

    Direct comparison across experiments is difficult because platforms, initial conditions, and reported figures of merit differ.

    Source: §IV · p. 14

Abstract

from arXiv · show

The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have become available for simulations and benchmarking, with up to few tens of qubits that can be reliably initialized, controlled, and measured. The present review aims at giving a comprehensive outlook on the state of art capabilities offered from these near-term noisy devices as universal quantum simulators, i.e. programmable quantum computers potentially able to calculate the time evolution of many physical models. First, we give a pedagogic overview on the basic theoretical background pertaining digital quantum simulations, with a focus on hardware-dependent mapping of spin-type Hamiltonians into the corresponding quantum circuit model as a key initial step towards simulating more complex models. Then, we review the main experimental achievements obtained in the last decade regarding the digital quantum simulation of such spin models, mostly employing the two leading quantum architectures. We compare their performances and outline future challenges, also in view of prospective hybrid technologies, towards the ultimate goal of reaching the long sought quantum advantage for the simulation of complex many body models in the physical sciences.

I. INTRODUCTION · II. THEORY OF DIGITAL QUANTUM SIMULATIONS

Classical methods face exponential resource demands for many-body quantum dynamics, motivating controllable quantum simulators. The review explains digital simulation theory and surveys near-term platforms, with local-interaction models and spin Hamiltonians central to its account.

I. INTRODUCTION

  • The illustrated digital workflow maps physical evolution to a qubit-encodable spin model, approximates it with Trotter-Suzuki time slices, and programs the resulting unitaries as a circuit.The circuit is run on a quantum computer to produce an approximated evolved state.Source: Figure 1 · p. 1
  • Classical simulations can fail for strongly correlated systems because capturing their dynamics requires exponentially growing time and memory as system size increases.The review argues that even elaborate approximate classical approaches may not give correct answers in these regimes, motivating quantum simulators.Source: §I · pp. 1–2
  • Digital quantum simulators are programmable general-purpose devices that can reproduce suitably encoded Hamiltonian dynamics with arbitrary precision, subject to local-interaction constraints.The review calls such digital quantum computers universal quantum simulators and represents their evolution through a sequence of quantum-circuit gates.Source: §I · p. 2
  • Efficient spin-model simulation is presented as a gateway to broader quantum simulation, including interacting-fermion models such as the Hubbard and Schwinger models.The review also emphasizes quantities such as quantum correlations that are difficult to compute but important for describing many-body dynamics.Source: §I · p. 2
  • The review frames quantum advantage as a goal: a certified memory- or time-efficiency gain over classical supercomputers, with 50 operational qubits presented as a possible NISQ turning point.The passage estimates that 50 qubits could store about 9 Pb of information, roughly the RAM of state-of-the-art supercomputers.Source: §I · p. 2
  • The review targets near-term digital computers, focusing on simulation accuracy for spin Hamiltonians on trapped-ion and superconducting-circuit platforms.It surveys experimental achievements from the last decade and anticipates that interesting results may be within reach on NISQ processors despite limited operations and uncorrected qubits.Source: §I · pp. 2–3

II. THEORY OF DIGITAL QUANTUM SIMULATIONS

  • Quantum dynamics evolves an initial state with U(t)=e^-iHt, while classical matrix exponentiation demands exponential time and memory as a composite system’s Hilbert space grows.The theory section introduces the Schrödinger equation as the governing evolution equation.Source: §II · p. 3
  • Feynman conjectured quantum simulation advantages, and Lloyd proved the approach for systems with local interactions, a restriction that still covers many physically interesting Hamiltonians.The review focuses on Hamiltonians composed of terms acting locally on portions of the system.Source: §II · p. 3

A. The quantum computer as a universal quantum simulator · B. Quantum simulations cookbook

Universal quantum computers can efficiently simulate polynomially local Hamiltonians by decomposing their evolution into local gates, while the cookbook maps a target model into qubits, compiles its dynamics, and measures observables.

A. The quantum computer as a universal quantum simulator

  • Although arbitrary N-qubit unitaries can be exponentially costly, Lloyd showed that evolution under a sum of polynomially many local terms can be simulated efficiently.Directly computing the full evolution operator is generally exponentially inefficient; locality allows the computation to be broken into smaller operations.Source: A. The quantum computer as a universal… · pp. 3–4
  • For noncommuting local terms, Suzuki–Trotter repeats time-sliced local evolutions to approximate U(t), with digital error O(t^2/n); commuting terms are exact at n=1.Increasing the number of time slices allows the approximation to be made arbitrarily accurate.Source: A. The quantum computer as a universal… · p. 4
  • An epsilon-accurate simulation takes polynomial resources when the number of local terms L is polynomial in N, as for nearest-neighbor interactions.The stated resource bound scales with the number of Trotter steps, L, and the size of the largest local subsystem.Source: A. The quantum computer as a universal… · p. 4

B. Quantum simulations cookbook

  • The cookbook begins by defining a Hamiltonian containing the target system’s dynamical information, then encoding its degrees of freedom into qubits and expressing the mapped Hamiltonian with Pauli matrices.Mapping is straightforward for collections of spin-1/2 objects, which also obey Pauli algebra.Source: B. Quantum simulations cookbook · p. 4
  • Efficient simulation relies on a sum of local terms, but Jordan–Wigner encoding can make local fermionic models non-local; multi-qubit gates can support efficient simulation of such models.The mapping is possible in principle for a large class of physical systems, not only spin systems.Source: B. Quantum simulations cookbook · p. 4
  • After mapping the Hamiltonian, check whether its terms commute: commuting terms evolve without digital error, while noncommuting terms require choosing Trotter steps for the desired precision and compiling local unitaries into gates.The circuit juxtaposes the compiled factors of the Suzuki–Trotter decomposition, repeated for the selected number of steps.Source: B. Quantum simulations cookbook · pp. 4–5
  • The simulation circuit starts with initial-state preparation and ends with measurements to recover expectation values of relevant observables; the same Hamiltonian-dynamics workflow can serve computational tasks beyond physical simulation.The cookbook presents these steps as general instructions for designing a quantum simulation algorithm.Source: B. Quantum simulations cookbook · p. 5

III. QUANTUM CIRCUITS · A. Pauli algebra and spin Hamiltonians

Digital quantum simulation depends on mapping target Hamiltonians and unitary evolutions onto hardware-native gates and interacting spin-1/2 operators. The review outlines how connectivity and locality affect efficient mapping, and introduces Pauli algebra and decomposition rules for spin Hamiltonians.

III. QUANTUM CIRCUITS

  • Translating unitary operators into elementary gates is typically hardware-dependent and especially critical to performance on noisy intermediate-scale processors.A platform is a potential universal quantum simulator if its native operations form a universal set, allowing target evolutions to be translated without unnecessary overhead.Source: §III · p. 5
  • Different qubit interconnectivity and gate-direction limits can add simulation overhead, while trapped ions’ all-to-all connectivity can ease long-range interactions and complicate fair performance comparisons [83].Topological constraints can be compensated, for example, with SWAP operations.Source: §III · p. 5
  • Systems described by local interaction terms are the cases guaranteed to map efficiently onto a quantum-computing register.Source: §III · p. 5

A. Pauli algebra and spin Hamiltonians

  • Qubits obey spin-1/2 Pauli algebra, expressed in the computational basis through Pauli matrices and their commutation and anticommutation rules.The passage identifies the Levi-Civita tensor, Kronecker delta, and identity matrix in those rules.Source: A. Pauli algebra and spin Hamiltonians · p. 5
  • Target Hamiltonians must map to equivalent interacting spin-1/2 Hamiltonians, with known effective mappings for higher-spin, fermionic, fermionic-bosonic, and gauge-theory lattice models.Heisenberg and Ising models are given as straightforward paradigmatic cases; other mappings are cited in the passage.Source: A. Pauli algebra and spin Hamiltonians · p. 5
  • An N-qubit simulation’s time-evolution generator generally contains single- and two-spin terms, to which other many-body term evolutions can in principle be reduced.Source: A. Pauli algebra and spin Hamiltonians · p. 5
  • When the Hamiltonian retains local structure, translation into elementary gates can be efficient, and the review supplies decomposition rules for universal gate sets drawn from use cases.The rules are presented as directly applicable to well-known physical models.Source: A. Pauli algebra and spin Hamiltonians · p. 5

B. Single-qubit rotations

Single-spin Hamiltonian terms act as effective magnetic fields, producing qubit precession that can be implemented using single-qubit rotations. Coordinate-axis rotations can realize arbitrary SU(2) operations, with other exact and approximate decompositions also available.

B. Single-qubit rotations

  • A register of N qubits encodes N spin-1/2 systems, and current proposed and realized platforms allow single-qubit addressing with tailored control pulses.Source: B. Single-qubit rotations · p. 5
  • Rotations around the coordinate axes can be implemented through particular U(θ, φ, λ) parameters, and conversely, axis rotations can realize an arbitrary U(θ, φ, λ).Examples include Rz(λ) = U(0, 0, λ), Rx(θ) = U(θ, −π/2, π/2), and Ry(θ) = U(θ, 0, 0), up to global phase factors.Source: B. Single-qubit rotations · p. 6
  • A single-spin term represents an effective magnetic field, whose induced time evolution precesses the qubit’s Bloch vector and can be expressed as an arbitrary U(θ, φ, λ) operation.The operation can be implemented as coordinate-axis rotations or as a combination of Hadamard and phase gates.Source: B. Single-qubit rotations · p. 6
  • Other decompositions of general SU(2) transformations and approximate implementations using a finite set of fixed-phase single-qubit operations are known.Source: B. Single-qubit rotations · p. 6

C. Two-qubits gates

Digital simulation of two-spin interactions compiles Pauli terms into single- and two-qubit gates, with implementations depending on each platform’s native operations. The section describes superconducting and trapped-ion gate sets and notes that model-specific optimization can reduce gate counts.

C. Two-qubits gates

  • Two-spin terms in general Pauli Hamiltonians are implemented as combinations of single- and two-qubit gates and arise in Heisenberg, XY, and transverse-field Ising models.The XY model results when Jzz = 0.Source: C. Two-qubits gates · p. 6
  • The CNOT-based universal set S1 uses single-qubit rotations and CNOT gates; frame changes generate other Pauli-pair terms, and the two-qubit Heisenberg evolution is assembled from commuting blocks.The CNOT-based set is described for superconducting qubits with cross-resonance interactions.Source: C. Two-qubits gates · pp. 6–7
  • The superconducting S2 set replaces CNOT with a parametric XX + YY interaction, using XX(δ) as a building block and single-qubit frame changes for other Pauli-pair terms.XX(δ) = e−iδσx⊗σx.Source: C. Two-qubits gates · p. 7
  • The superconducting S3 set combines single-qubit rotations with controlled-phase gates; single CΦ(δ) gates yield ZZ(δ) with single-qubit corrections, while x- or y-rotations enable negative and small angles when phase range is limited.Controlled-phase gates are natively implemented on superconducting platforms with state-dependent frequency shifts [64, 85, 95–97] and are related to the Ising interaction.Source: C. Two-qubits gates · p. 7
  • Trapped-ion set S4 uses individual z rotations, collective non-entangling operations, and Mølmer-Sørensen gates; subsets can be addressed, and T4(δ, 0) yields XX(δ) on two qubits.The collective gates are particularly suited to simulating long-range and multiple-body interactions; the set is described for trapped-ion simulators.Source: C. Two-qubits gates · p. 7
  • Model-specific optimization of combined two-qubit operations can reduce total gate counts beyond elementary decompositions, with Heisenberg examples using S1 and S2 discussed later.The elementary decompositions support digital simulation of generic spin Hamiltonians but are not necessarily optimal.Source: C. Two-qubits gates · p. 7

D. Multiple-qubit interactions

The section describes how to extend two-qubit building blocks to N-qubit interactions and decompose them into one- and two-qubit operations. It also notes that trapped-ion processors can implement many-body terms efficiently with Mølmer–Sørensen gates.

D. Multiple-qubit interactions

  • N-qubit interaction terms lead to unitary evolution that can be decomposed into single- and two-qubit operations, with an S1 example generalized to N > 3.Individual qubits can also undergo reference-frame changes, as in the N = 2 case.Source: D. Multiple-qubit interactions · p. 8
  • Trapped-ion processors can efficiently decompose N-body terms using native Mølmer–Sørensen gates, with N limited in principle by hardware scalability.Source: D. Multiple-qubit interactions · p. 8

E. Suzuki-Trotter decomposition and digital error

Digital quantum simulations must balance Suzuki-Trotter error against hardware noise and the circuit growth caused by adding Trotter steps. The section compares fixed-precision and fixed-step strategies for managing that trade-off.

E. Suzuki-Trotter decomposition and digital error

  • For noncommuting operators, the first-order Suzuki-Trotter formula incurs digital error that must be kept below hardware noise in practice, while the second-order formula improves error scaling at an extra factor per iteration.Adding Trotter steps increases gate count, so it cannot be continued indefinitely on non-error-corrected processors without affecting result quality.Source: E. Suzuki-Trotter decomposition and… · p. 8
  • The ratio rϵ = δp/nq governs digital error as a function of target phase and Trotter-step count, enabling either fixed precision or fixed circuit length.For fixed precision, the step count and circuit length must increase while rϵ stays constant; hardware execution remains linear in total phase if each step takes time proportional to 1/δn.Source: E. Suzuki-Trotter decomposition and… · p. 8
  • With fixed n = 5, fidelity fails after a short phase; linear growth n = δ/2ϵ also degrades at long times, while n = δ²/2ϵ keeps digital error under control in the illustrated two-qubit case.The figure uses ϵ = 0.1 and increases n to about 10^4 for quadratic scaling.Source: Figure 2 · p. 8, E. Suzuki-Trotter decomposition and… · p. 9
  • With fixed circuit length, first-order digital error scales with δ², yielding uniform hardware-noise exposure but agreement with the target model only over a limited phase range.Hybrid step counts across phase intervals can balance hardware noise, digital error, and software-level approximations.Source: E. Suzuki-Trotter decomposition and… · pp. 8–9

F. Extracting physical observables

The section presents computational-basis readout for physical observables and ancilla-assisted methods for extracting dynamical correlations and Hermitian-operator spectra. These methods use controlled unitaries, quantum evolution, and, for spectra, a classical FFT.

F. Extracting physical observables

  • Expectation values are reconstructed by mapping observables to spin-1/2 operators and measuring in the computational basis, with unitary readout rotations when needed.For a single-qubit σx measurement, a Hadamard maps σx to σz before standard computational-basis measurement; joint qubit measurements can characterize the output state.Source: F. Extracting physical observables · p. 9
  • The dynamical-correlation circuit prepares the register state and an ancilla in |+⟩, applies controlled W, evolves the register, then applies controlled V.The register is assumed already prepared in the desired state, such as the target system’s ground state.Source: F. Extracting physical observables · p. 9
  • The correlation’s imaginary part is measured via the ancilla, and equal-time correlations follow by removing or relocating time evolution; n-point functions are also accessible.The useful output is obtained from the ancilla alone, so the larger register need not be measured at the end.Source: F. Extracting physical observables · p. 9
  • A classical FFT of time-correlation data can extract a Hermitian operator’s spectrum, with the Hamiltonian as a key example and an initial state overlapping its eigenstates required.The approach was proposed in Ref. 33 and further developed and applied, including in Ref. 103.Source: F. Extracting physical observables · pp. 9–10
  • For Hermitian Q, the ancilla protocol measures ⟨ψ|e−iQθ|ψ⟩, and applying an FFT over θ yields spectral information from Q’s eigenvalues.The unitary e−iQθ is implemented like a standard time-evolution operator, with the time-evolution step removed and W = UQ(θ), V = I.Source: F. Extracting physical observables · p. 10

G. Examples

The examples show how digital circuits simulate small Heisenberg and transverse-field Ising models, compute spin correlations, and extend to larger spin systems and fermionic models. They also identify parallel execution and native many-body interactions as ways to address circuit depth when scaling up.

G. Examples

  • For the 2-qubit Heisenberg model, decompositions include 6 CNOTs in S1, a more efficient global two-qubit transformation, and an optimal three-gate S2 decomposition.S3 uses three CΦ(δ) gates, while S4 offers a realization for some digital resolutions.Source: G. Examples · p. 10
  • The examples simulate 2-qubit Heisenberg magnetization with no digital error, a 3-qubit Heisenberg-chain occupation probability, and transverse-field Ising dimer magnetization.Figure 5 compares exact evolution, Suzuki-Trotter approximations, and quantum-circuit simulations; the Ising simulation uses S1 operations.Source: G. Examples · pp. 10–12, Figure 5 · p. 11
  • An ancilla-based circuit computes 3-spin Heisenberg dynamical correlations from an initial state approximated by |↓↓↓⟩; the reported circuit results use n = 5 Trotter steps.The circuit shown targets next-to-nearest-neighbor cross correlations; autocorrelations and nearest-neighbor correlations use similar circuits with a changed target qubit.Source: Figure 6 · p. 11, G. Examples · p. 12, Figure 7 · p. 12
  • For larger spin systems, disjoint local interaction terms commute and can be simulated in parallel, reducing circuit depth; ancilla methods can in principle extract O(N^2) two-body correlations with polynomially many circuit repetitions.In a four-spin chain, the 1–2 and 3–4 interaction blocks can run in parallel.Source: G. Examples · p. 12
  • Jordan-Wigner mapping turns fermionic models into Pauli Hamiltonians simulable on qubit registers, but multidimensional or long-range couplings produce multi-spin terms that deepen circuits; native many-body interactions can help NISQ simulation.For a one-dimensional fermionic chain with on-site and nearest-neighbor interactions, the mapped Hamiltonian contains only one- and two-spin terms; the two-site Hubbard example maps to a 4-qubit register.Source: G. Examples · pp. 12–13

IV. EXPERIMENTAL ACHIEVEMENTS AND PROSPECTIVE TECHNOLOGIES

The review surveys digital quantum simulations on trapped-ion and superconducting platforms, reporting deeper circuits for trapped ions while emphasizing error mitigation and unresolved scalability challenges.

IV. EXPERIMENTAL ACHIEVEMENTS AND PROSPECTIVE TECHNOLOGIES

  • Quantum volume captures circuit width and reliable depth, but scaling requires high-fidelity multi-qubit operations despite decoherence, coherent errors, and cross-talk.Very high reported fidelities often come from optimized two-qubit setups; addressing and cross-talk challenges in larger connected systems can make gates slower and more error-prone.Source: §IV · pp. 13–14
  • Trapped-ion simulators reach deeper circuits and up to 6 spins, versus 4 spins on superconducting devices, where 5 Trotter steps leave fidelity slightly above 60%.The review notes that comparisons are difficult because experiments use different platforms, initial conditions, and figures of merit; fidelity generally correlates with the number of digital steps.Source: §IV · p. 14, Figure 8 · p. 14
  • Stabilizer-like mitigation may detect 60-80% of depolarizing errors, while zero-noise interpolation and combining approaches are proposed to improve observable accuracy.Zero-noise suppression was applied to incoherent errors in superconducting-circuit variational calculations.Source: §IV · p. 14
  • Neither platform currently fulfills scalability, which requires increasing qubit numbers without degrading preparation, readout, or gate fidelities.The review identifies addressing these issues as a forthcoming challenge before fault-tolerant quantum computation.Source: §IV · p. 14

A. UQS with trapper ions

The section presents trapped ions as high-coherence, all-to-all quantum hardware for programmable digital simulations, while emphasizing the difficulty of maintaining performance as systems scale.

A. UQS with trapper ions

  • Trapped-ion qubits offer all-to-all connectivity, with isolated-ion single-qubit fidelities around 99.9999% and two-qubit gate fidelities exceeding 99.9%.Entangling gates use the ion string’s transverse vibrational modes as a bus; hyperfine-qubit hardware can use XX gates as its native two-qubit gate.Source: A. UQS with trapper ions · p. 15
  • Mølmer–Sørensen gate fidelity fell from 99.6% with 2 optical qubits to 86% with 10, while an 11-qubit hyperfine processor averaged 99.5% single-qubit and 97.5% XX-gate fidelities [133] [116].Scaling is limited by factors including individual-addressing cross-talk and control or decoherence errors; operating more than a few tens of fully controlled qubits remains challenging.Source: A. UQS with trapper ions · pp. 16–17
  • The seminal optical-qubit processor was reprogrammable across spin models and interaction terms, demonstrating digital simulation up to 6 spins and multi-spin terms [100].Figure 9 shows two-spin simulations at increasing complexity, with up to 12 Trotter steps.Source: A. UQS with trapper ions · p. 16, Figure 9 · p. 16
  • A four-qubit trapped-ion circuit simulated particle-antiparticle pair creation from vacuum fluctuations and the persistence of their entanglement in a lattice gauge-field model.The simulation mapped fermionic degrees of freedom to Pauli spin operators using the Jordan-Wigner transformation.Source: A. UQS with trapper ions · pp. 16–17
  • Trapped-ion platforms also support hybrid VQE applications spanning the Schwinger model, molecular energies, and deuteron binding energy [136] [137].The deuteron binding energy was calculated with percent accuracy; a hyperfine-qubit processor was used to obtain the water molecule’s ground-state energy.Source: A. UQS with trapper ions · p. 17

B. UQS with superconducting circuits

Superconducting circuits enabled digital simulations of spin models and other quantum systems, with demonstrations spanning short-time dynamics, correlation functions, and hybrid algorithms. Their speed and scalability potential are constrained by coherence, control, connectivity, and readout errors.

B. UQS with superconducting circuits

  • Transmons achieved single-qubit gate fidelities above 99.9%, while tunable-frequency controlled-phase gates took 40 ns and fixed-frequency cross-resonant gates took ∼200 −300 ns.Tunable-frequency gates were described as more promising for concatenated simulation circuits; readout usually took hundreds of ns at accuracy above 96%, although more than 99% readout fidelity was demonstrated in 140 ns.Source: B. UQS with superconducting circuits · pp. 17–18
  • After about 2 or 3 Trotter steps, depending on phase, experimental state fidelity began to decrease, and 5-step simulations remained limited by short coherence times and systematic circuit errors.The first digital spin-model simulations on superconducting hardware were reported in 2015; the 4-qubit processor implemented 2-spin Heisenberg and Ising evolutions with up to 5 steps.Source: B. UQS with superconducting circuits · pp. 18–19, Figure 10 · p. 18
  • n = 4 Trotter steps were simulated for spin dimers and n = 2 for trimers on IBM processors, with dynamical correlations showing encouraging agreement with ideal evolution [155].The largest reported IBM simulation used 5 qubits—4 for the target system and 1 ancilla for correlation readout—and accuracy improved with problem-specific post-processing.Source: B. UQS with superconducting circuits · p. 19, Figure 11 · p. 19
  • Experiments extended superconducting quantum simulation beyond spin dynamics to a Fermi-Hubbard model with up to 4 modes, a 9-spin adiabatic-to-digital chain, and hybrid quantum-classical chemistry, nuclear, and Schwinger-model calculations.The chemistry work calculated multi-atomic molecular ground-state energies with precision approaching chemical accuracy.Source: B. UQS with superconducting circuits · pp. 19–20
  • Coherent control errors, frequency crowding, crosstalk, and connectivity mismatches constrain deeper circuits, while superconducting processors offer faster gates but smaller coherence-time-to-gate-time ratios than trapped ions [136].IBM quantum volume doubled yearly from 4 to 8 to 16 between 2017 and 2019; larger-system quantitative accuracy still requires better noise understanding and mitigation [155]. A proposed problem-independent mitigation approach requires controllable noise and addresses incoherent errors.Source: B. UQS with superconducting circuits · p. 20

C. Prospective technologies for UQS

The section surveys prospective quantum-simulation platforms beyond trapped ions and superconducting circuits, whose ability to reach large logical-qubit counts remains uncertain. It highlights promising semiconductor and hybrid proposals alongside photonic, molecular, and neutral-atom approaches that still face significant limitations.

Semiconductor technologies

  • Silicon quantum dots have shown CNOT fidelity of about 78%, two-qubit gate fidelities around 80%, single-qubit rotation precision of ∼99%, and gating times below 100 ns.Dephasing times are about 200 ns; the approach remains short of leading-platform performance but could enable low-cost, mass-scale manufacturing.Source: C. Prospective technologies for UQS · pp. 20–21
  • Phosphorus donor electrons in silicon have demonstrated a SWAP operation with an 800 ps gating time and around 94% fidelity, though scalability remains a challenge.Single-spin readout and manipulation have been demonstrated and two-qubit gates proposed for this potential low-cost platform.Source: C. Prospective technologies for UQS · p. 21

Photonic platforms

  • Photonic integrated circuits have weak interactions, and no single-photon sensitivity from nonlinear-material confinement or proof-of-principle photonic quantum-computer demonstration was known at the time of writing.Exciton-polaritons show single-quantum sensitivity but remain immature as qubits, although they may support analog simulators of strongly interacting photonic lattices.Source: C. Prospective technologies for UQS · p. 21

Molecular platforms

  • Magnetic molecules offer long coherence and chemical tunability for pulse-controlled electronic or nuclear spin qubits, with the molecular Hilbert space also enabling proposed error-corrected logical-qubit encoding.Source: C. Prospective technologies for UQS · p. 21

Hybrid technologies

  • Hybrid spin-resonator simulations of a 3-spin Ising model reached ~95% average fidelity, while electromechanical 2-spin simulations reached 99.9% without EMR dephasing and about 99% with realistic pure dephasing.The proposals aim to combine long coherence, tunable photon manipulation, scalability, chip-scale integration, and operational reliability.Source: Figure 12 · p. 21, C. Prospective technologies for UQS · pp. 21–22

Neutral atoms

  • Rydberg neutral-atom arrays have supported analog simulation with more than 50 atoms and two-qubit entanglement at ∼97% fidelity, but controlled digital quantum simulation remains premature.Short coherence times relative to trapped ions are among the challenges for quantum-computing applications [187].Source: C. Prospective technologies for UQS · p. 21

V. OUTLOOK AND PERSPECTIVES

The review frames quantum computers as programmable universal simulators, surveys digital simulation of spin models, and discusses prospective hardware, hybrid approaches, and routes toward quantum advantage.

V. OUTLOOK AND PERSPECTIVES

  • Universal simulation maps physical models to effective local Hamiltonians obeying Pauli algebra and encodes them in qubit circuits, enabling measurements of spectra and correlation functions.The review focuses on Heisenberg and Ising models, whose techniques can extend to many-body systems such as the Fermi-Hubbard model that are typically intractable classically because of exponential resource scaling.Source: §V · p. 22
  • The review also points to emerging technologies that could become quantum-computing hardware and to prospective hybrid approaches that may eventually be tested.Source: §V · p. 22
  • Quantum volume is currently limited to fewer than 10 useful qubits; higher gate fidelities, shorter gate durations, and error mitigation are near-term needs, while 30–40 could bring quantum advantage within reach for targeted applications [83] [198].The review anticipates that quantum error correction could enable universal simulations with arbitrary digital precision.Source: §V · p. 22
  • The review identifies potential applications in dynamical localization, quantum neural networks, and open-system dynamics.Digitized non-unitary evolution is also an active topic; classical many-body methods such as quantum Monte Carlo, molecular dynamics, and density matrix renormalization group could be integrated into quantum algorithms.Source: §V · pp. 22–23
Loading 1907.03505v2…