{ "id": "epccq86krj", "slug": "digital-quantum-simulation", "title": "Digital quantum simulation", "updated": "2026-10-15", "topic_path": [ { "id": "technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/topics/technology" }, { "id": "technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing" }, { "id": "technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai" }, { "id": "technology.computing.ai.algorithms", "label": "Algorithms and computational methods", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.algorithms" }, { "id": "technology.computing.ai.numerical_string_geometry", "label": "Numerical, string, and geometric algorithms", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.numerical_string_geometry" }, { "id": "technology.computing.ai.numerical_string_geometry.numerical_analysis_methods", "label": "Numerical methods and approximation", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.numerical_string_geometry.numerical_analysis_methods" } ], "geo": [ { "id": "geo.nongeo.t2001.technology.computing.ai.numerical_string_geometry", "label": "Non-geographic · 2001 to 2020: Numerical, string, and geometric algorithms", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.numerical_string_geometry", "path": [ { "id": "geo.nongeo", "label": "Non-geographic", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo" }, { "id": "geo.nongeo.t2001", "label": "Non-geographic · 2001 to 2020", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001" }, { "id": "geo.nongeo.t2001.technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology" }, { "id": "geo.nongeo.t2001.technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing" }, { "id": "geo.nongeo.t2001.technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai" }, { "id": "geo.nongeo.t2001.technology.computing.ai.algorithms", "label": "Algorithms and computational methods", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.algorithms" }, { "id": "geo.nongeo.t2001.technology.computing.ai.numerical_string_geometry", "label": "Numerical, string, and geometric algorithms", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.numerical_string_geometry" } ] } ], "excerpt": "Digital quantum simulation (DQS) is a computational method that uses a programmable quantum computer to reproduce a quantum system's time evolution as a sequence of discrete quantum gates.", "snippet": "Digital quantum simulation (DQS) is a computational method that uses a programmable quantum computer to reproduce a quantum system's time evolution as a sequence of discrete quantum gates.", "node": "technology.computing.ai.numerical_string_geometry.numerical_analysis_methods", "markdown": "# Digital quantum simulation\n\nDigital quantum simulation (DQS) is a computational method that uses a programmable quantum computer to reproduce the time evolution of a quantum system as a sequence of discrete quantum gates. It computes approximations to real-time dynamics: either the evolution operator itself, or observables at chosen times, written as expectation values of the form \\( \\langle M(t)\\rangle = \\langle 0|e^{iHt}Me^{-iHt}|0\\rangle \\) for a Hamiltonian \\( H \\) and a measured observable \\( M \\).[1](https://www.nature.com/articles/s41534-024-00877-y) The adjective \"digital\" distinguishes the approach from analog quantum simulation, which emulates a target Hamiltonian in a custom-designed experiment rather than by compiling it into gates.[2](https://iopscience.iop.org/article/10.1088/1367-2630/14/10/103017)\n\n| Key fact | Detail |\n|---|---|\n| What is computed | Real-time dynamics: the evolution operator \\( e^{-iHt} \\) or observables \\( \\langle M(t)\\rangle \\) at chosen times[1](https://www.nature.com/articles/s41534-024-00877-y) |\n| Core decomposition | First-order Trotter formula with error \\( O(t^2/n) \\) for \\( n \\) time steps[3](https://arxiv.org/pdf/1907.03505) |\n| Best proven query complexity | Qubitization achieves \\( O(t + \\log(1/\\epsilon)) \\) oracle queries, optimal in all parameters[4](https://doi.org/10.22331/q-2019-07-12-163) |\n| Early hardware demonstration | Trapped ions, 2011: spin-model dynamics with up to 100 gates on 6 qubits[5](https://www.science.org/doi/10.1126/science.1208001) |\n| Main failure mode | Trotter discretization error, which vanishes only with infinitely many gates[1](https://www.nature.com/articles/s41534-024-00877-y) |\n| Recent direction | Fault-tolerant evolution inside gauge covariant error-correcting codes (2026)[6](https://quantum-journal.org/papers/q-2026-01-16-1968/) |\n\n## How it works\n\nThe Hamiltonian to be simulated is written as a sum \\( H = \\sum_l H_l \\) of terms that can each be implemented directly as a gate or short gate sequence, typically operators in the qubit Pauli algebra. The first-order Trotter formula handles the simulation by slicing time into \\( n \\) steps:\n\n\\[ U(t) = e^{-i\\sum_l H_l t} = \\left(\\prod_l e^{-iH_l t/n}\\right)^n + O\\left(\\frac{t^2}{n}\\right). \\]\n\nThis application of the Suzuki-Trotter formula is known in the field as Trotterization.[3](https://arxiv.org/pdf/1907.03505) The error term \\( O(t^2/n) \\) arises from commutators of the terms; for any target accuracy \\( \\epsilon \\) there exists a number of steps \\( n_\\epsilon \\) such that \\( U(t) \\) is computed within \\( \\epsilon \\) using at most \\( n_{\\epsilon} \\cdot L \\cdot m_{\\mathrm{max}}^{2} \\) operations, where \\( L \\) is the number of terms and \\( m_{\\mathrm{max}} \\) bounds the terms' sizes.[3](https://arxiv.org/pdf/1907.03505) When the Hamiltonian's terms commute, as in the Ising Hamiltonian, there is no Trotter error at all.[7](https://www.tandfonline.com/doi/pdf/10.1080/23746149.2018.1457981)\n\n## How it is done\n\nA practitioner's workflow runs in five stages. First, define the model Hamiltonian and map it onto the qubit Pauli algebra, so each term \\( H_l \\) becomes a product of Pauli operators with a known coefficient. Second, choose the number of Trotter steps \\( n \\) needed for the required precision at the target time \\( t \\). Third, translate each local unitary \\( e^{-iH_l t/n} \\) into a gate sequence; any universal gate set can do this in at most \\( O(m_l^2) \\) operations per term. Fourth, prepare the initial state. Fifth, measure: expectation values \\( \\langle O(t)\\rangle = \\langle\\psi(t)|O|\\psi(t)\\rangle \\) are reconstructed by a readout procedure combining unitary rotations with measurements in the computational basis, for example a [Hadamard gate](https://www.edgepedia.org/hadamard-gate) before readout to measure \\( \\langle\\sigma_x\\rangle \\).[3](https://arxiv.org/pdf/1907.03505) The choice of simulation algorithm is matched to the problem: product formulas, the randomized compiling method qDRIFT, and quantum signal processing suit time-independent Hamiltonians, while linear combinations of unitaries with truncated Taylor or Dyson series are well suited to time-dependent Hamiltonians.[8](https://www.cambridge.org/core/books/quantum-algorithms/hamiltonian-simulation/94D3D7A8C829393E75EEC4A6678DB62A)\n\n## Origin\n\nIn 1982, [Richard P. Feynman](https://www.edgepedia.org/richard-p-feynman) conjectured that a controllable quantum system used as a computing resource would provide significant advantages in simulating quantum systems, proposing a \"new kind of computer, a quantum computer\" for the task.[9](https://doi.org/10.1007/bf02650179) In 1996, [Seth Lloyd](https://www.edgepedia.org/seth-lloyd) proved the idea essentially correct in *Science*, showing that Feynman's conjecture that quantum computers can simulate any local quantum system holds, with the sole limitation that the simulated systems carry only local interactions.[10](https://doi.org/10.1126/science.273.5278.1073) Lloyd was the first to propose an explicit quantum algorithm for simulating Hamiltonian evolution, using the Trotter formula for systems of limited-dimension subsystems with time-independent Hamiltonians consisting of sums of interaction terms; the complexity scales as \\( O(\\|H\\| \\cdot \\Delta t)^{2} \\).[11](https://ar5iv.labs.arxiv.org/html/1011.3489) Algorithms for sparse Hamiltonians were developed in 2005 by Dominic W. Berry, Graeme Ahokas, Richard Cleve, and Barry C. Sanders.[12](https://doi.org/10.48550/arxiv.quant-ph/0508139)\n\n## Variants\n\n**Product formulas** remain the workhorse. The recent THRIFT family of time-dependent product formulas improves the error scaling: \\( k \\)-th-order THRIFT achieves error \\( O(\\alpha^{2} \\cdot t^{k+1}) \\) compared with \\( O(\\alpha \\cdot t^{k+1}) \\) for standard \\( k \\)-th-order formulas, with gate complexity \\( O(\\alpha \\cdot T \\cdot (\\alpha \\cdot T/\\epsilon)^{1/(k-1)}) \\).[13](https://www.nature.com/articles/s41467-025-57580-5)\n\n**Truncated Taylor series** methods, introduced by Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma in 2015, approximate the [Taylor series](https://www.edgepedia.org/taylor-series) of the evolution operator using linear combinations of unitary operations with oblivious amplitude amplification; their cost depends only logarithmically on the inverse precision, which is optimal.[14](https://doi.org/10.1103/physrevlett.114.090502)\n\n**Quantum signal processing**, developed by Guang Hao Low and [Isaac L. Chuang](https://www.edgepedia.org/isaac-l-chuang) in 2017, works by transducing the eigenvalues of \\( H \\) into a single ancilla qubit, transforming them, and applying the signal-processing step.[15](https://doi.org/10.1103/physrevlett.118.010501) Its successor, **qubitization** (Low and Chuang, 2019), uses controlled oracles to embed any \\( \\hat H \\) in an invariant SU(2) subspace and reaches query complexity \\( O(t + \\log(1/\\epsilon)) \\), optimal in both asymptotic and non-asymptotic regimes, with at most two additional ancilla qubits; it subsumes prior methods for \\( d \\)-sparse Hamiltonians and linear combinations of unitaries.[4](https://doi.org/10.22331/q-2019-07-12-163)\n\n**Randomized methods** such as qDRIFT perform particularly well for non-sparse Hamiltonians where the number of terms grows faster than \\( O(L) \\) in the qubit count \\( L \\).[1](https://www.nature.com/articles/s41534-024-00877-y) A 2024 randomized-compilation algorithm eliminates discretization error entirely, with runtime \\( O(t^{2} \\cdot \\mu^{2} \\cdot \\epsilon^{-2}) \\) to reach precision \\( \\epsilon \\), where \\( \\mu \\) is the sum of the Hamiltonian's coefficients, and generalizes to time-dependent Hamiltonians without overhead.[1](https://www.nature.com/articles/s41534-024-00877-y)\n\n## Applications\n\nAn early hardware demonstration came in 2011, when trapped ions were used to simulate the full time dynamics of a range of spin systems with sequences of up to 100 gates on 6 qubits.[5](https://www.science.org/doi/10.1126/science.1208001) Lattice gauge theories followed: a (1+1)D SU(2) lattice gauge theory was digitally simulated on a trapped-ion-qudit processor using a first-order [Suzuki-Trotter decomposition](https://www.edgepedia.org/trotter-suzuki-product-formulas) \\( \\hat U(t_f) = e^{-i\\hat H t_f} \\simeq (\\prod_j e^{-i\\hat h_j \\, dt})^{n_{ST}} \\), with the two-qudit gate count \\( N_{\\mathrm{gates}} = (N-1)^{2} \\cdot n_{\\mathrm{ST}} \\cdot D \\) scaling linearly in system size and Trotter steps.[16](https://journals.aps.org/prxquantum/abstract/10.1103/PRXQuantum.5.040309) More recently, a measurement-based simulation of real-time dynamics in the (2+1)D \\( Z_2 \\) gauge theory ran on the 56-qubit [Quantinuum System Model H2](https://www.edgepedia.org/honeywell-h2-trapped-ion-quantum-computer) trapped-ion processor, consuming virtual 3D cluster states of 200 and 288 resource-state qubits on 2×2 and 3×3 lattices.[17](https://arxiv.org/html/2608.04290) On the algorithmic side, the 2024 discretization-free algorithm was demonstrated on the electronic structure of the stretched water molecule and a 2D [Ising model](https://www.edgepedia.org/ising-model), outperforming both Trotter formulas and other randomized compilation techniques.[1](https://www.nature.com/articles/s41534-024-00877-y)\n\n## Limitations and alternatives\n\nProduct-formula methods approximate continuous evolution with finite-depth circuits, so their Trotter errors vanish only with infinitely many gates; these errors generically lead to effective heating in adiabatic state preparation and are problematic in quantum chemistry.[1](https://www.nature.com/articles/s41534-024-00877-y) The trade-off among alternatives is consistent: product formulas are simple and low-overhead but carry discretization error, while LCU, quantum signal processing, and quantum walks have better theoretical scalings but require large resource overheads.[1](https://www.nature.com/articles/s41534-024-00877-y) Error mitigation now plays a practical role in experiments; in the Quantinuum H2 gauge-theory experiment, the mid-circuit measurement record both drives the Trotterized evolution and supplies one-form-symmetry syndromes used for postselection, which strongly suppresses observed Gauss-law violations and improves agreement with ideal Trotterized dynamics.[17](https://arxiv.org/html/2608.04290) A step toward early fault tolerance came in January 2026, when a gauge covariant error-correcting code for Abelian \\( Z_2 \\) lattice gauge theories was used to demonstrate fault-tolerant time evolution with both product formulas and qubitization, an approach that saves physical qubits by connecting simulation algorithms with quantum error correction.[6](https://quantum-journal.org/papers/q-2026-01-16-1968/)\n\n## References\n\n1. [Hamiltonian dynamics on digital quantum computers without discretization error](https://www.nature.com/articles/s41534-024-00877-y)\n2. [Quantum-circuit design for efficient simulations of many-body quantum dynamics (New J. Phys. 14, 103017, 2012)](https://iopscience.iop.org/article/10.1088/1367-2630/14/10/103017)\n3. [Digital quantum simulation review / lecture notes (arXiv:1907.03505)](https://arxiv.org/pdf/1907.03505)\n4. [Guang Hao Low, Isaac L. Chuang (2019). Hamiltonian Simulation by Qubitization. Quantum.](https://doi.org/10.22331/q-2019-07-12-163)\n5. [Universal Digital Quantum Simulation with Trapped Ions](https://www.science.org/doi/10.1126/science.1208001)\n6. [Fault-tolerant simulation of Lattice Gauge Theories with gauge covariant codes](https://quantum-journal.org/papers/q-2026-01-16-1968/)\n7. [Advances in quantum simulation review (Advances in Physics: X)](https://www.tandfonline.com/doi/pdf/10.1080/23746149.2018.1457981)\n8. [Hamiltonian simulation (Chapter 11), Quantum Algorithms (Cambridge University Press)](https://www.cambridge.org/core/books/quantum-algorithms/hamiltonian-simulation/94D3D7A8C829393E75EEC4A6678DB62A)\n9. [Richard P. Feynman (1982). Simulating physics with computers. International Journal of Theoretical Physics.](https://doi.org/10.1007/bf02650179)\n10. [Seth Lloyd (1996). Universal Quantum Simulators. Science.](https://doi.org/10.1126/science.273.5278.1073)\n11. [Simulating Quantum Dynamics On A Quantum Computer](https://ar5iv.labs.arxiv.org/html/1011.3489)\n12. [Berry, Dominic W. and colleagues (2005). Efficient quantum algorithms for simulating sparse Hamiltonians. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.quant-ph/0508139)\n13. [Efficient and practical Hamiltonian simulation from time-dependent product formulas](https://www.nature.com/articles/s41467-025-57580-5)\n14. [Dominic W. Berry and colleagues (2015). Simulating Hamiltonian Dynamics with a Truncated Taylor Series. Physical Review Letters.](https://doi.org/10.1103/physrevlett.114.090502)\n15. [Guang Hao Low, Isaac L. Chuang (2017). Optimal Hamiltonian Simulation by Quantum Signal Processing. Physical Review Letters.](https://doi.org/10.1103/physrevlett.118.010501)\n16. [Digital Quantum Simulation of a (1+1)D SU(2) Lattice Gauge Theory with Ion Qudits](https://journals.aps.org/prxquantum/abstract/10.1103/PRXQuantum.5.040309)\n17. [Measurement-based simulation of lattice gauge theory dynamics with adaptive quantum circuits on a trapped-ion processor](https://arxiv.org/html/2608.04290)\n\n---\n*Topic: Encyclopedia › Technology and the built world › Computing and digital systems › Artificial intelligence and data › Algorithms and computational methods › Numerical, string, and geometric algorithms › Numerical methods and approximation*\n\n*Initially written Sep 29, 2026 · Reviewed: Sep 30, 2026 · Edited: Sep 30, 2026; Oct 15, 2026 · Last review: Sep 30, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n", "same_as": [], "url": "https://www.edgepedia.org/digital-quantum-simulation", "markdown_url": "https://www.edgepedia.org/digital-quantum-simulation.md", "license": { "name": "Edgepedia Community License 1.0", "url": "https://www.edgepedia.org/edgepedia/license", "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.", "spdx": "LicenseRef-Edgepedia-Community-1.0" }, "credit": "\"Digital quantum simulation\", Edgepedia (EdgeChat), https://www.edgepedia.org/digital-quantum-simulation. Edgepedia Community License 1.0.", "credit_md": "\"[Digital quantum simulation](https://www.edgepedia.org/digital-quantum-simulation)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/digital-quantum-simulation](https://www.edgepedia.org/digital-quantum-simulation). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).", "credit_html": "\"Digital quantum simulation\", Edgepedia (EdgeChat), https://www.edgepedia.org/digital-quantum-simulation. Edgepedia Community License 1.0.", "speakable": "Digital quantum simulation is a computational method that uses a programmable quantum computer to reproduce a quantum system's time evolution as a sequence of discrete quantum gates." }