A High-Performance Pauli-Algebra Framework for Large-Scale Quantum Simulations

Jie Liu; Jinlong Yang; Xiaopeng Li; Yi Fan; Zhenyu Li; Zhijie Sun

arxiv: 2606.28952 · v1 · pith:ZI4AZLWAnew · submitted 2026-06-27 · 🪐 quant-ph

A High-Performance Pauli-Algebra Framework for Large-Scale Quantum Simulations

Xiaopeng Li , Zhijie Sun , Yi Fan , Jie Liu , Zhenyu Li , Jinlong Yang This is my paper

Pith reviewed 2026-06-30 09:25 UTC · model grok-4.3

classification 🪐 quant-ph

keywords Pauli algebraquantum simulationVQEHamiltonian constructionmany-body physicsquantum chemistrysparse representationssymmetry adaptation

0 comments

The pith

A Pauli-algebra framework with binary symplectic encoding and grouped sparse representations accelerates Hamiltonian construction and VQE in quantum simulations.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper presents a framework for efficient manipulation of Pauli operators that combines compact binary symplectic encoding, canonical coefficient reduction, and grouped sparse representations exploiting shared bit-flip patterns. This targets repeated operations in Hamiltonian construction, variational ansatz preparation, expectation-value evaluation, and real-time propagation for quantum chemistry and many-body physics. A sympathetic reader cares because these operations form the main bottleneck in classical emulation and benchmarking of quantum algorithms. The Julia and C++ code delivers speedups for sparse and symmetry-adapted many-electron spaces on multicore CPUs and GPUs, demonstrated on large-active-space VQE, ADAPT-VQE, and variational dynamics.

Core claim

The framework accelerates Pauli multiplication, Hamiltonian construction, and operator-state multiplication in sparse and symmetry-adapted many-electron spaces by using compact binary symplectic encoding, canonical coefficient reduction, and grouped sparse operator representations that exploit shared bit-flip patterns among Pauli strings.

What carries the argument

Grouped sparse operator representations that exploit shared bit-flip patterns among Pauli strings, supported by binary symplectic encoding and canonical coefficient reduction.

If this is right

Hamiltonian construction for large active spaces in quantum chemistry becomes computationally practical.
Large-active-space VQE and ADAPT-VQE calculations run efficiently on classical multicore hardware.
Real-time variational dynamics simulations scale to modern CPU and GPU architectures.
A scalable classical backend supports development and benchmarking of quantum algorithms in chemistry and many-body physics.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The encoding and grouping techniques may extend to operator algebras in other quantum information tasks beyond Pauli strings.
Faster classical references could improve verification of results from near-term quantum hardware.
Similar structure-aware optimizations might apply to tensor-network or other many-body simulation methods.

Load-bearing premise

The grouped sparse operator representations that exploit shared bit-flip patterns among Pauli strings will yield practical speedups for the targeted Hamiltonian construction and VQE tasks in many-electron spaces.

What would settle it

Benchmarks on a standard many-electron Hamiltonian with hundreds of orbitals showing no runtime reduction compared to existing Pauli libraries for VQE or Hamiltonian construction.

read the original abstract

Efficient manipulation of Pauli-algebraic objects is a key bottleneck in the classical emulation and benchmarking of quantum algorithms for chemistry and many-body physics. This bottleneck appears in Hamiltonian construction, variational ansatz preparation, expectation-value and gradient evaluation, and real-time propagation, all of which require repeated Pauli-algebra operations. Here, we present a high-performance Pauli-algebra framework tailored to quantum many-body and quantum-chemical simulations. The framework combines compact binary symplectic encoding, canonical coefficient reduction, and grouped sparse operator representations that exploit shared bit-flip patterns among Pauli strings. The resulting Julia/C\texttt{++} implementation accelerates Pauli multiplication, Hamiltonian construction, and operator--state multiplication in sparse and symmetry-adapted many-electron spaces. Benchmarks demonstrate efficient Hamiltonian construction, large-active-space VQE and ADAPT-VQE calculations, and real-time variational dynamics on modern multicore CPU and GPU architectures. These results show that structure-aware Pauli-algebra engines provide a scalable classical backend for developing and benchmarking quantum algorithms in quantum chemistry and many-body simulation.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper ships a usable Pauli framework with grouped sparse representations and benchmarks that back the speedups for VQE and Hamiltonian tasks in many-electron spaces.

read the letter

The main point is a Pauli-algebra engine that pairs binary symplectic encoding with grouped sparse representations to cut down on redundant operations during multiplication and Hamiltonian construction. The Julia/C++ code targets sparse, symmetry-adapted many-electron spaces and the benchmarks cover VQE, ADAPT-VQE, and real-time dynamics on CPU and GPU hardware.

The work does a good job spelling out the algorithms, including the coefficient reduction step and the grouping procedure based on shared bit-flip patterns. Those details plus the timing results give a clear picture of where the gains come from and how they scale with active-space size.

Soft spots are minor. The benchmarks show efficiency but would be stronger with side-by-side numbers against a couple of standard libraries to isolate the contribution of the new grouping. The scope stays inside symmetry-adapted spaces, which is reasonable for the target but leaves open how much extra work is needed for unstructured cases.

This is aimed at people who build classical backends for quantum chemistry algorithm development and hit Pauli bottlenecks. The concrete code and falsifiable timings are enough to justify sending it to referees.

Referee Report

0 major / 1 minor

Summary. The manuscript introduces a high-performance Pauli-algebra framework for quantum many-body and quantum-chemical simulations. It combines compact binary symplectic encoding, canonical coefficient reduction, and grouped sparse operator representations that exploit shared bit-flip patterns among Pauli strings. The resulting Julia/C++ implementation is claimed to accelerate Pauli multiplication, Hamiltonian construction, and operator-state multiplication in sparse and symmetry-adapted many-electron spaces, with benchmarks for efficient Hamiltonian construction, large-active-space VQE/ADAPT-VQE, and real-time variational dynamics on multicore CPU/GPU architectures.

Significance. If the reported performance gains hold under scrutiny, the framework supplies a practical, structure-aware classical backend that directly mitigates a recurring bottleneck in emulating and benchmarking quantum algorithms for chemistry and many-body physics. The provision of explicit algorithmic descriptions together with benchmark timings on modern hardware constitutes a concrete, falsifiable contribution.

minor comments (1)

The abstract states that 'benchmarks demonstrate efficient...' yet supplies no numerical values, error bars, or hardware specifications; the main text should ensure all timing tables include these details for reproducibility.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for recommending acceptance. No major comments were provided in the report.

Circularity Check

0 steps flagged

No significant circularity; framework is algorithmic and benchmark-validated

full rationale

The paper presents an algorithmic framework combining binary symplectic encoding, coefficient reduction, and grouped sparse representations for Pauli operations, followed by explicit implementation details and benchmark timings on CPU/GPU hardware for VQE and dynamics tasks. No derivation step reduces by construction to fitted parameters renamed as predictions, self-definitional equations, or load-bearing self-citations; the central claims rest on described procedures whose performance is measured externally rather than assumed. The manuscript is self-contained against its own benchmarks and does not invoke uniqueness theorems or ansatzes from prior author work to force its choices.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review provides no explicit free parameters, axioms, or invented entities; the framework description implies standard assumptions about Pauli operator structure in quantum chemistry but does not detail them.

pith-pipeline@v0.9.1-grok · 5719 in / 1068 out tokens · 22787 ms · 2026-06-30T09:25:45.522465+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

66 extracted references · 8 canonical work pages · 6 internal anchors

[1]

Quantum Computing in the NISQ era and beyond

Preskill, J. Quantum Computing in the NISQ era and beyond. Quantum 2018, 2, 79

2018
[2]

P.; Degroote, M.; Johnson, P

Cao, Y.; Romero, J.; Olson, J. P.; Degroote, M.; Johnson, P. D.; Kieferov \'a , M.; Kivlichan, I. D.; Menke, T.; Peropadre, B.; Sawaya, N. P.; others Quantum chemistry in the age of quantum computing. Chem.\ Rev. 2019, 119, 10856--10915

2019
[3]

McArdle, S.; Endo, S.; Aspuru-Guzik, A.; others Quantum computational chemistry. Rev. Mod. Phys. 2020, 92, 015003

2020
[4]

Quantum algorithms for electronic structures: basis sets and boundary conditions

Liu, J.; Fan, Y.; Li, Z.; Yang, J. Quantum algorithms for electronic structures: basis sets and boundary conditions. Chem. Soc. Rev. 2022, 51, 3263--3279

2022
[5]

J.; Aspuru-Guzik, A.; O'Brien, J

Peruzzo, A.; McClean, J.; Shadbolt, P.; Yung, M.-H.; Zhou, X.-Q.; Love, P. J.; Aspuru-Guzik, A.; O'Brien, J. L. A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 2014, 5, 4213

2014
[6]

Cerezo, M.; Arrasmith, A.; Babbush, R.; others Variational quantum algorithms. Nat. Rev. Phys. 2021, 3, 625--644

2021
[7]

H.; Tennyson, J

Tilly, J.; Chen, H.; Cao, S.; Picozzi, D.; Setia, K.; Li, Y.; Grant, E.; Wossnig, L.; Rungger, I.; Booth, G. H.; Tennyson, J. The Variational Quantum Eigensolver: A Review of Methods and Best Practices. Phys. Rep. 2022, 986, 1--128

2022
[8]

Simulating Periodic Systems on a Quantum Computer Using Molecular Orbitals

Liu, J.; Wan, L.; Li, Z.; Yang, J. Simulating Periodic Systems on a Quantum Computer Using Molecular Orbitals. J. Chem. Theory Comput. 2020, 16, 6904--6914

2020
[9]

F.; de Jong, W

Bassman Oftelie, L.; Urbanek, M.; Metcalf, M.; Carter, J.; Kemper, A. F.; de Jong, W. A. Simulating quantum materials with digital quantum computers. Quantum Sci. Technol. 2021, 6, 043002

2021
[10]

J.; Tacchino, F.; Tavernelli, I

Miessen, A.; Ollitrault, P. J.; Tacchino, F.; Tavernelli, I. Quantum algorithms for quantum dynamics. Nat. Comput. Sci. 2023, 3, 25--37

2023
[11]

A Practical Quantum Instruction Set Architecture

Smith, R. S.; Curtis, M. J.; Zeng, W. J. A Practical Quantum Instruction Set Architecture. arXiv preprint arXiv:1608.03355 2017,

work page internal anchor Pith review Pith/arXiv arXiv 2017
[12]

qHiPSTER: The Quantum High Performance Software Testing Environment

Smelyanskiy, M.; Sawaya, N. P.; Aspuru-Guzik, A. qHiPSTER: The quantum high performance software testing environment. arXiv preprint arXiv:1601.07195 2016,

work page internal anchor Pith review Pith/arXiv arXiv 2016
[13]

H \"a ner, T.; Steiger, D. S. 0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit. Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. 2017; pp 1--10

2017
[14]

PennyLane: Automatic differentiation of hybrid quantum-classical computations

Bergholm, V.; Izaac, J.; Schuld, M.; Gogolin, C.; Ahmed, S.; Ajith, V.; Alam, M. S.; Alonso-Linaje, G.; AkashNarayanan, B.; Asadi, A.; others Pennylane: Automatic differentiation of hybrid quantum-classical computations. arXiv preprint arXiv:1811.04968 2018,

work page internal anchor Pith review Pith/arXiv arXiv 2018
[15]

Gustafson, E.; Holzman, B.; Kowalkowski, J.; Lamm, H.; Li, A. C. Y.; Perdue, G.; Isakov, S. V.; Martin, O.; Thomson, R.; Beall, J.; Ganahl, M.; Vidal, G.; Peters, E. Large scale multi-node simulations of Z2 gauge theory quantum circuits using Google Cloud Platform. 2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS). 2021; pp 72--79

2021
[16]

Jones, T.; Brown, A.; Bush, I.; Benjamin, S. C. QuEST and high performance simulation of quantum computers. Sci. Rep. 2019, 9, 10736

2019
[17]

M.; Mitarai, K.; Imai, R.; Tamiya, S.; Yamamoto, T.; Yan, T.; Kawakubo, T.; Nakagawa, Y

Suzuki, Y.; Kawase, Y.; Masumura, Y.; Hiraga, Y.; Nakadai, M.; Chen, J.; Nakanishi, K. M.; Mitarai, K.; Imai, R.; Tamiya, S.; Yamamoto, T.; Yan, T.; Kawakubo, T.; Nakagawa, Y. O.; Ibe, Y.; Zhang, Y.; Yamashita, H.; Yoshimura, H.; Hayashi, A.; Fujii, K. Qulacs: a fast and versatile quantum circuit simulator for research purpose. Quantum 2021, 5, 559

2021
[18]

R.; Rubin, N

McClean, J. R.; Rubin, N. C.; Sung, K. J.; Kivlichan, I. D.; Bonet-Monroig, X.; Cao, Y.; Dai, C.; Fried, E. S.; Gidney, C.; Gimby, B.; Gokhale, P.; H \"a ner, T.; Hardikar, T.; Havl \'i c ek, V.; Higgott, O.; Huang, C.; Izaac, J.; Jiang, Z.; Liu, X.; McArdle, S.; Neeley, M.; O'Brien, T.; O'Gorman, B.; Ozfidan, I.; Radin, M. D.; Romero, J.; Sawaya, N. P. D...

2020
[19]

Q ^2 Chemistry: A quantum computation platform for quantum chemistry

Fan, Y.; Liu, J.; Zeng, X.; Xu, Z.; Shang, H.; Li, Z.; Yang, J. Q ^2 Chemistry: A quantum computation platform for quantum chemistry. JUSTC 2022, 52, 2--1--2--12

2022
[20]

GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm

Willsch, D.; Willsch, M.; Jin, F.; Michielsen, K.; De Raedt , H. GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm. Comput.\ Phys.\ Commun. 2022, 278, 108411

2022
[21]

Bayraktar, H.; Charara, A.; Clark, D.; Cohen, S.; Costa, T.; Fang, Y.-L. L.; Gao, Y.; Guan, J.; Gunnels, J.; Haidar, A.; Hehn, A.; Hohnerbach, M.; Jones, M.; Lubowe, T.; Lyakh, D.; Morino, S.; Springer, P.; Stanwyck, S.; Terentyev, I.; Varadhan, S.; Wong, J.; Yamaguchi, T. cuQuantum SDK: A High-Performance Library for Accelerating Quantum Science. 2023 IE...

2023
[22]

Quantum computing with Qiskit

Javadi-Abhari, A.; Treinish, M.; Krsulich, K.; Wood, C. J.; Lishman, J.; Gacon, J.; Martiel, S.; Nation, P. D.; Bishop, L. S.; Cross, A. W.; Johnson, B. R.; Gambetta, J. M. Quantum Computing with Qiskit . arXiv preprint arXiv:2405.08810 2024,

work page internal anchor Pith review Pith/arXiv arXiv 2024
[23]

P.; Shuai, Z.; Zhang, S

Li, W.; Allcock, J.; Cheng, L.; Zhang, S.-X.; Chen, Y.-Q.; Mailoa, J. P.; Shuai, Z.; Zhang, S. TenCirChem: An Efficient Quantum Computational Chemistry Package for the NISQ Era. J. Chem.\ Theory Comput. 2023, 19, 3966--3981

2023
[24]

Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design

Luo, X.-Z.; Liu, J.-G.; Zhang, P.; Wang, L. Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design. Quantum 2020, 4, 341

2020
[25]

V.; Kafri, D.; Martin, O.; Heidweiller, C

Isakov, S. V.; Kafri, D.; Martin, O.; Heidweiller, C. V.; Mruczkiewicz, W.; Harrigan, M. P.; Rubin, N. C.; Thomson, R.; Broughton, M.; Kissell, K.; others Simulations of Quantum Circuits with Approximate Noise using qsim and Cirq. arXiv preprint arXiv:2111.02396 2021,

work page arXiv 2021
[26]

Efficient Classical Simulation of Slightly Entangled Quantum Computations

Vidal, G. Efficient Classical Simulation of Slightly Entangled Quantum Computations. Phys. Rev. Lett. 2003, 91, 147902

2003
[27]

L.; Shi, Y

Markov, I. L.; Shi, Y. Simulating Quantum Computation by Contracting Tensor Networks. SIAM J. Comput. 2008, 38, 963--981

2008
[28]

Hyper-Optimized Tensor Network Contraction

Gray, J.; Kourtis, S. Hyper-Optimized Tensor Network Contraction. Quantum 2021, 5, 410

2021
[29]

Simulation of Quantum Circuits Using the Big-Batch Tensor Network Method

Pan, F.; Chen, K.; Zhang, P. Simulation of Quantum Circuits Using the Big-Batch Tensor Network Method. Phys. Rev. Lett. 2022, 128, 030501

2022
[30]

L.; Larocca, M.; Cincio, L.; Cerezo, M.; Sauvage, F

Goh, M. L.; Larocca, M.; Cincio, L.; Cerezo, M.; Sauvage, F. Lie-algebraic classical simulations for quantum computing. Phys. Rev. Research 2025, 7, 033266

2025
[31]

F.; Kemper, A

K \"o kc \"u , E.; Steckmann, T.; Wang, Y.; Freericks, J.; Dumitrescu, E. F.; Kemper, A. F. Fixed depth Hamiltonian simulation via Cartan decomposition. Phys.\ Rev.\ Lett. 2022, 129, 070501

2022
[32]

Hybrid hamiltonian simulation for excitation dynamics

Wan, L.; Liu, J.; Li, Z.; Yang, J. Hybrid hamiltonian simulation for excitation dynamics. J. Phys.\ Chem.\ Lett. 2024, 15, 11234--11243

2024
[33]

Calculation of the Green’s Function on Near-term Quantum Computers via Cartan Decomposition

Wan, L.; Liu, J.; Yang, J. Calculation of the Green’s Function on Near-term Quantum Computers via Cartan Decomposition. Chem. Res. Chin. Univ. 2025, 41, 1029--1036

2025
[34]

Stabilizer codes and quantum error correction; California Institute of Technology, 1997

Gottesman, D. Stabilizer codes and quantum error correction; California Institute of Technology, 1997

1997
[35]

Stim: a fast stabilizer circuit simulator

Gidney, C. Stim: a fast stabilizer circuit simulator. Quantum 2021, 5, 497

2021
[36]

Clifford group, stabilizer states, and linear and quadratic operations over GF (2)

Dehaene, J.; De Moor, B. Clifford group, stabilizer states, and linear and quadratic operations over GF (2). Phys.\ Rev. A 2003, 68, 042318

2003
[37]

Tapering off qubits to simulate fermionic Hamiltonians

Bravyi, S.; Gambetta, J. M.; Mezzacapo, A.; Temme, K. Tapering off qubits to simulate fermionic Hamiltonians. arXiv preprint arXiv:1701.08213 2017,

work page internal anchor Pith review Pith/arXiv arXiv 2017
[38]

Efficiently Manipulating Pauli Strings with PauliArray

Dion, M.; Belabbas, T.; Bastien, N. Efficiently Manipulating Pauli Strings with PauliArray . arXiv preprint arXiv:2405.19287 2024,

work page arXiv 2024
[39]

Tensorized Pauli decomposition algorithm

Hantzko, L.; Binkowski, L.; Gupta, S. Tensorized Pauli decomposition algorithm. Phys. Scr. 2024, 99, 085128

2024
[40]

Verteletskyi, V.; Yen, T.-C.; Izmaylov, A. F. Measurement optimization in the variational quantum eigensolver using a minimum clique cover. J. Chem.\ Theory Comput. 2020, 152, 124114

2020
[41]

U ber das Paulische \

Jordan, P.; Wigner, E. \"U ber das Paulische \"A quivalenzverbot. Z. Phys. 1928, 47, 631--651

1928
[42]

B.; Kitaev, A

Bravyi, S. B.; Kitaev, A. Y. Fermionic quantum computation. Annals of Physics 2002, 298, 210--226

2002
[43]

T.; Richard, M

Seeley, J. T.; Richard, M. J.; Love, P. J. The Bravyi--Kitaev transformation for quantum computation of electronic structure. J. Chem.\ Phys. 2012, 137, 224109

2012
[44]

S.; Lloyd, S

Abrams, D. S.; Lloyd, S. Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors. Phys.\ Rev.\ Lett. 1999, 83, 5162--5165

1999
[45]

Kitaev, A. Y. Quantum Measurements and the Abelian Stabilizer Problem. arXiv preprint arXiv:quant-ph/9511026 1995,

work page internal anchor Pith review Pith/arXiv arXiv 1995
[46]

D.; Love, P

Aspuru-Guzik, A.; Dutoi, A. D.; Love, P. J.; Head-Gordon, M. Simulated quantum computation of molecular energies. Science 2005, 309, 1704--1707

2005
[47]

Universal quantum simulators

Lloyd, S. Universal quantum simulators. Science 1996, 273, 1073--1078

1996
[48]

General theory of fractal path integrals with applications to many-body theories and statistical physics

Suzuki, M. General theory of fractal path integrals with applications to many-body theories and statistical physics. J. Math. Phys. 1991, 32, 400--407

1991
[49]

W.; Childs, A

Berry, D. W.; Childs, A. M.; Cleve, R.; Kothari, R.; Somma, R. D. Simulating Hamiltonian dynamics with a truncated Taylor series. Phys. Rev. Lett. 2015, 114, 090502

2015
[50]

H.; Chuang, I

Low, G. H.; Chuang, I. L. Hamiltonian simulation by qubitization. Quantum 2019, 3, 163

2019
[51]

H.; Chuang, I

Low, G. H.; Chuang, I. L. Optimal Hamiltonian simulation by quantum signal processing. Phys. Rev. Lett. 2017, 118, 010501

2017
[52]

A.; Chan, G

Evangelista, F. A.; Chan, G. K.; Scuseria, G. E. Exact parameterization of fermionic wave functions via unitary coupled cluster theory. J. Chem.\ Phys. 2019, 151

2019
[53]

S.; Armaos, V.; Barnes, C

Yordanov, Y. S.; Armaos, V.; Barnes, C. H.; Arvidsson-Shukur, D. R. Qubit-excitation-based adaptive variational quantum eigensolver. Chem.\ Phys. 2021, 4, 228

2021
[54]

Circuit-Efficient Qubit Excitation-Based Variational Quantum Eigensolver

Sun, Z.; Li, X.; Liu, J.; Li, Z.; Yang, J. Circuit-Efficient Qubit Excitation-Based Variational Quantum Eigensolver. J. Chem.\ Theory Comput. 2025, 21, 5071--5082

2025
[55]

Adaptive Variational Quantum Simulations of Periodic Materials Using Qubit-Encoded Wave Functions

Li, X.; Fan, Y.; Liu, J.; Li, Z.; Yang, J. Adaptive Variational Quantum Simulations of Periodic Materials Using Qubit-Encoded Wave Functions. J. Chem.\ Theory Comput. 2025, 21, 5973--5985

2025
[56]

Evaluating analytic gradients on quantum hardware

Schuld, M.; Bergholm, V.; Gogolin, C.; Izaac, J.; Killoran, N. Evaluating analytic gradients on quantum hardware. Phys.\ Rev. A 2019, 99, 032331

2019
[57]

Quantum circuit learning

Mitarai, K.; Negoro, M.; Kitagawa, M.; Fujii, K. Quantum circuit learning. Phys.\ Rev. A 2018, 98, 032309

2018
[58]

J.; Handy, N

Knowles, P. J.; Handy, N. C. A new determinant-based full configuration interaction method. Chem.\ Phys.\ Lett. 1984, 111, 315--321

1984
[59]

O.; Jo/rgensen, P.; Jensen, H

Olsen, J.; Roos, B. O.; Jo/rgensen, P.; Jensen, H. J. A. Determinant based configuration interaction algorithms for complete and restricted configuration interaction spaces. J. Chem.\ Phys. 1988, 89, 2185--2192

1988
[60]

S.; Lidar, D

Wu, L.-A.; Byrd, M. S.; Lidar, D. Polynomial-time simulation of pairing models on a quantum computer. Phys.\ Rev.\ Lett. 2002, 89, 057904

2002
[61]

J.; Thuente, D

Mor\' e , J. J.; Thuente, D. J. Line search algorithms with guaranteed sufficient decrease. ACM Trans. Math. Softw. 1994, 20, 286–307

1994
[62]

W.; Van Neck , D

Wouters, S.; Poelmans, W.; Ayers, P. W.; Van Neck , D. CheMPS2: A free open-source spin-adapted implementation of the density matrix renormalization group for ab initio quantum chemistry. Comput.\ Phys.\ Commun. 2014, 185, 1501--1514

2014
[63]

R.; Economou, S

Grimsley, H. R.; Economou, S. E.; Barnes, E.; Mayhall, N. J. An adaptive variational algorithm for exact molecular simulations on a quantum computer. Nat.\ Chem. 2019, 10

2019
[64]

An efficient quantum algorithm for the time evolution of parameterized circuits

Barison, S.; Vicentini, F.; Carleo, G. An efficient quantum algorithm for the time evolution of parameterized circuits. Quantum 2021, 5, 512

2021
[65]

McLachlan, A. D. A Variational Solution of the Time-Dependent Schr\"odinger Equation. Mol. Phys. 1964, 8, 39--44

1964
[66]

Yuan, X.; Endo, S.; Zhao, Q.; Li, Y.; Benjamin, S. C. Theory of variational quantum simulation. Quantum 2019, 3, 191 mcitethebibliography

2019

[1] [1]

Quantum Computing in the NISQ era and beyond

Preskill, J. Quantum Computing in the NISQ era and beyond. Quantum 2018, 2, 79

2018

[2] [2]

P.; Degroote, M.; Johnson, P

Cao, Y.; Romero, J.; Olson, J. P.; Degroote, M.; Johnson, P. D.; Kieferov \'a , M.; Kivlichan, I. D.; Menke, T.; Peropadre, B.; Sawaya, N. P.; others Quantum chemistry in the age of quantum computing. Chem.\ Rev. 2019, 119, 10856--10915

2019

[3] [3]

McArdle, S.; Endo, S.; Aspuru-Guzik, A.; others Quantum computational chemistry. Rev. Mod. Phys. 2020, 92, 015003

2020

[4] [4]

Quantum algorithms for electronic structures: basis sets and boundary conditions

Liu, J.; Fan, Y.; Li, Z.; Yang, J. Quantum algorithms for electronic structures: basis sets and boundary conditions. Chem. Soc. Rev. 2022, 51, 3263--3279

2022

[5] [5]

J.; Aspuru-Guzik, A.; O'Brien, J

Peruzzo, A.; McClean, J.; Shadbolt, P.; Yung, M.-H.; Zhou, X.-Q.; Love, P. J.; Aspuru-Guzik, A.; O'Brien, J. L. A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 2014, 5, 4213

2014

[6] [6]

Cerezo, M.; Arrasmith, A.; Babbush, R.; others Variational quantum algorithms. Nat. Rev. Phys. 2021, 3, 625--644

2021

[7] [7]

H.; Tennyson, J

Tilly, J.; Chen, H.; Cao, S.; Picozzi, D.; Setia, K.; Li, Y.; Grant, E.; Wossnig, L.; Rungger, I.; Booth, G. H.; Tennyson, J. The Variational Quantum Eigensolver: A Review of Methods and Best Practices. Phys. Rep. 2022, 986, 1--128

2022

[8] [8]

Simulating Periodic Systems on a Quantum Computer Using Molecular Orbitals

Liu, J.; Wan, L.; Li, Z.; Yang, J. Simulating Periodic Systems on a Quantum Computer Using Molecular Orbitals. J. Chem. Theory Comput. 2020, 16, 6904--6914

2020

[9] [9]

F.; de Jong, W

Bassman Oftelie, L.; Urbanek, M.; Metcalf, M.; Carter, J.; Kemper, A. F.; de Jong, W. A. Simulating quantum materials with digital quantum computers. Quantum Sci. Technol. 2021, 6, 043002

2021

[10] [10]

J.; Tacchino, F.; Tavernelli, I

Miessen, A.; Ollitrault, P. J.; Tacchino, F.; Tavernelli, I. Quantum algorithms for quantum dynamics. Nat. Comput. Sci. 2023, 3, 25--37

2023

[11] [11]

A Practical Quantum Instruction Set Architecture

Smith, R. S.; Curtis, M. J.; Zeng, W. J. A Practical Quantum Instruction Set Architecture. arXiv preprint arXiv:1608.03355 2017,

work page internal anchor Pith review Pith/arXiv arXiv 2017

[12] [12]

qHiPSTER: The Quantum High Performance Software Testing Environment

Smelyanskiy, M.; Sawaya, N. P.; Aspuru-Guzik, A. qHiPSTER: The quantum high performance software testing environment. arXiv preprint arXiv:1601.07195 2016,

work page internal anchor Pith review Pith/arXiv arXiv 2016

[13] [13]

H \"a ner, T.; Steiger, D. S. 0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit. Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. 2017; pp 1--10

2017

[14] [14]

PennyLane: Automatic differentiation of hybrid quantum-classical computations

Bergholm, V.; Izaac, J.; Schuld, M.; Gogolin, C.; Ahmed, S.; Ajith, V.; Alam, M. S.; Alonso-Linaje, G.; AkashNarayanan, B.; Asadi, A.; others Pennylane: Automatic differentiation of hybrid quantum-classical computations. arXiv preprint arXiv:1811.04968 2018,

work page internal anchor Pith review Pith/arXiv arXiv 2018

[15] [15]

Gustafson, E.; Holzman, B.; Kowalkowski, J.; Lamm, H.; Li, A. C. Y.; Perdue, G.; Isakov, S. V.; Martin, O.; Thomson, R.; Beall, J.; Ganahl, M.; Vidal, G.; Peters, E. Large scale multi-node simulations of Z2 gauge theory quantum circuits using Google Cloud Platform. 2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS). 2021; pp 72--79

2021

[16] [16]

Jones, T.; Brown, A.; Bush, I.; Benjamin, S. C. QuEST and high performance simulation of quantum computers. Sci. Rep. 2019, 9, 10736

2019

[17] [17]

M.; Mitarai, K.; Imai, R.; Tamiya, S.; Yamamoto, T.; Yan, T.; Kawakubo, T.; Nakagawa, Y

Suzuki, Y.; Kawase, Y.; Masumura, Y.; Hiraga, Y.; Nakadai, M.; Chen, J.; Nakanishi, K. M.; Mitarai, K.; Imai, R.; Tamiya, S.; Yamamoto, T.; Yan, T.; Kawakubo, T.; Nakagawa, Y. O.; Ibe, Y.; Zhang, Y.; Yamashita, H.; Yoshimura, H.; Hayashi, A.; Fujii, K. Qulacs: a fast and versatile quantum circuit simulator for research purpose. Quantum 2021, 5, 559

2021

[18] [18]

R.; Rubin, N

McClean, J. R.; Rubin, N. C.; Sung, K. J.; Kivlichan, I. D.; Bonet-Monroig, X.; Cao, Y.; Dai, C.; Fried, E. S.; Gidney, C.; Gimby, B.; Gokhale, P.; H \"a ner, T.; Hardikar, T.; Havl \'i c ek, V.; Higgott, O.; Huang, C.; Izaac, J.; Jiang, Z.; Liu, X.; McArdle, S.; Neeley, M.; O'Brien, T.; O'Gorman, B.; Ozfidan, I.; Radin, M. D.; Romero, J.; Sawaya, N. P. D...

2020

[19] [19]

Q ^2 Chemistry: A quantum computation platform for quantum chemistry

Fan, Y.; Liu, J.; Zeng, X.; Xu, Z.; Shang, H.; Li, Z.; Yang, J. Q ^2 Chemistry: A quantum computation platform for quantum chemistry. JUSTC 2022, 52, 2--1--2--12

2022

[20] [20]

GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm

Willsch, D.; Willsch, M.; Jin, F.; Michielsen, K.; De Raedt , H. GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm. Comput.\ Phys.\ Commun. 2022, 278, 108411

2022

[21] [21]

Bayraktar, H.; Charara, A.; Clark, D.; Cohen, S.; Costa, T.; Fang, Y.-L. L.; Gao, Y.; Guan, J.; Gunnels, J.; Haidar, A.; Hehn, A.; Hohnerbach, M.; Jones, M.; Lubowe, T.; Lyakh, D.; Morino, S.; Springer, P.; Stanwyck, S.; Terentyev, I.; Varadhan, S.; Wong, J.; Yamaguchi, T. cuQuantum SDK: A High-Performance Library for Accelerating Quantum Science. 2023 IE...

2023

[22] [22]

Quantum computing with Qiskit

Javadi-Abhari, A.; Treinish, M.; Krsulich, K.; Wood, C. J.; Lishman, J.; Gacon, J.; Martiel, S.; Nation, P. D.; Bishop, L. S.; Cross, A. W.; Johnson, B. R.; Gambetta, J. M. Quantum Computing with Qiskit . arXiv preprint arXiv:2405.08810 2024,

work page internal anchor Pith review Pith/arXiv arXiv 2024

[23] [23]

P.; Shuai, Z.; Zhang, S

Li, W.; Allcock, J.; Cheng, L.; Zhang, S.-X.; Chen, Y.-Q.; Mailoa, J. P.; Shuai, Z.; Zhang, S. TenCirChem: An Efficient Quantum Computational Chemistry Package for the NISQ Era. J. Chem.\ Theory Comput. 2023, 19, 3966--3981

2023

[24] [24]

Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design

Luo, X.-Z.; Liu, J.-G.; Zhang, P.; Wang, L. Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design. Quantum 2020, 4, 341

2020

[25] [25]

V.; Kafri, D.; Martin, O.; Heidweiller, C

Isakov, S. V.; Kafri, D.; Martin, O.; Heidweiller, C. V.; Mruczkiewicz, W.; Harrigan, M. P.; Rubin, N. C.; Thomson, R.; Broughton, M.; Kissell, K.; others Simulations of Quantum Circuits with Approximate Noise using qsim and Cirq. arXiv preprint arXiv:2111.02396 2021,

work page arXiv 2021

[26] [26]

Efficient Classical Simulation of Slightly Entangled Quantum Computations

Vidal, G. Efficient Classical Simulation of Slightly Entangled Quantum Computations. Phys. Rev. Lett. 2003, 91, 147902

2003

[27] [27]

L.; Shi, Y

Markov, I. L.; Shi, Y. Simulating Quantum Computation by Contracting Tensor Networks. SIAM J. Comput. 2008, 38, 963--981

2008

[28] [28]

Hyper-Optimized Tensor Network Contraction

Gray, J.; Kourtis, S. Hyper-Optimized Tensor Network Contraction. Quantum 2021, 5, 410

2021

[29] [29]

Simulation of Quantum Circuits Using the Big-Batch Tensor Network Method

Pan, F.; Chen, K.; Zhang, P. Simulation of Quantum Circuits Using the Big-Batch Tensor Network Method. Phys. Rev. Lett. 2022, 128, 030501

2022

[30] [30]

L.; Larocca, M.; Cincio, L.; Cerezo, M.; Sauvage, F

Goh, M. L.; Larocca, M.; Cincio, L.; Cerezo, M.; Sauvage, F. Lie-algebraic classical simulations for quantum computing. Phys. Rev. Research 2025, 7, 033266

2025

[31] [31]

F.; Kemper, A

K \"o kc \"u , E.; Steckmann, T.; Wang, Y.; Freericks, J.; Dumitrescu, E. F.; Kemper, A. F. Fixed depth Hamiltonian simulation via Cartan decomposition. Phys.\ Rev.\ Lett. 2022, 129, 070501

2022

[32] [32]

Hybrid hamiltonian simulation for excitation dynamics

Wan, L.; Liu, J.; Li, Z.; Yang, J. Hybrid hamiltonian simulation for excitation dynamics. J. Phys.\ Chem.\ Lett. 2024, 15, 11234--11243

2024

[33] [33]

Calculation of the Green’s Function on Near-term Quantum Computers via Cartan Decomposition

Wan, L.; Liu, J.; Yang, J. Calculation of the Green’s Function on Near-term Quantum Computers via Cartan Decomposition. Chem. Res. Chin. Univ. 2025, 41, 1029--1036

2025

[34] [34]

Stabilizer codes and quantum error correction; California Institute of Technology, 1997

Gottesman, D. Stabilizer codes and quantum error correction; California Institute of Technology, 1997

1997

[35] [35]

Stim: a fast stabilizer circuit simulator

Gidney, C. Stim: a fast stabilizer circuit simulator. Quantum 2021, 5, 497

2021

[36] [36]

Clifford group, stabilizer states, and linear and quadratic operations over GF (2)

Dehaene, J.; De Moor, B. Clifford group, stabilizer states, and linear and quadratic operations over GF (2). Phys.\ Rev. A 2003, 68, 042318

2003

[37] [37]

Tapering off qubits to simulate fermionic Hamiltonians

Bravyi, S.; Gambetta, J. M.; Mezzacapo, A.; Temme, K. Tapering off qubits to simulate fermionic Hamiltonians. arXiv preprint arXiv:1701.08213 2017,

work page internal anchor Pith review Pith/arXiv arXiv 2017

[38] [38]

Efficiently Manipulating Pauli Strings with PauliArray

Dion, M.; Belabbas, T.; Bastien, N. Efficiently Manipulating Pauli Strings with PauliArray . arXiv preprint arXiv:2405.19287 2024,

work page arXiv 2024

[39] [39]

Tensorized Pauli decomposition algorithm

Hantzko, L.; Binkowski, L.; Gupta, S. Tensorized Pauli decomposition algorithm. Phys. Scr. 2024, 99, 085128

2024

[40] [40]

Verteletskyi, V.; Yen, T.-C.; Izmaylov, A. F. Measurement optimization in the variational quantum eigensolver using a minimum clique cover. J. Chem.\ Theory Comput. 2020, 152, 124114

2020

[41] [41]

U ber das Paulische \

Jordan, P.; Wigner, E. \"U ber das Paulische \"A quivalenzverbot. Z. Phys. 1928, 47, 631--651

1928

[42] [42]

B.; Kitaev, A

Bravyi, S. B.; Kitaev, A. Y. Fermionic quantum computation. Annals of Physics 2002, 298, 210--226

2002

[43] [43]

T.; Richard, M

Seeley, J. T.; Richard, M. J.; Love, P. J. The Bravyi--Kitaev transformation for quantum computation of electronic structure. J. Chem.\ Phys. 2012, 137, 224109

2012

[44] [44]

S.; Lloyd, S

Abrams, D. S.; Lloyd, S. Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors. Phys.\ Rev.\ Lett. 1999, 83, 5162--5165

1999

[45] [45]

Kitaev, A. Y. Quantum Measurements and the Abelian Stabilizer Problem. arXiv preprint arXiv:quant-ph/9511026 1995,

work page internal anchor Pith review Pith/arXiv arXiv 1995

[46] [46]

D.; Love, P

Aspuru-Guzik, A.; Dutoi, A. D.; Love, P. J.; Head-Gordon, M. Simulated quantum computation of molecular energies. Science 2005, 309, 1704--1707

2005

[47] [47]

Universal quantum simulators

Lloyd, S. Universal quantum simulators. Science 1996, 273, 1073--1078

1996

[48] [48]

General theory of fractal path integrals with applications to many-body theories and statistical physics

Suzuki, M. General theory of fractal path integrals with applications to many-body theories and statistical physics. J. Math. Phys. 1991, 32, 400--407

1991

[49] [49]

W.; Childs, A

Berry, D. W.; Childs, A. M.; Cleve, R.; Kothari, R.; Somma, R. D. Simulating Hamiltonian dynamics with a truncated Taylor series. Phys. Rev. Lett. 2015, 114, 090502

2015

[50] [50]

H.; Chuang, I

Low, G. H.; Chuang, I. L. Hamiltonian simulation by qubitization. Quantum 2019, 3, 163

2019

[51] [51]

H.; Chuang, I

Low, G. H.; Chuang, I. L. Optimal Hamiltonian simulation by quantum signal processing. Phys. Rev. Lett. 2017, 118, 010501

2017

[52] [52]

A.; Chan, G

Evangelista, F. A.; Chan, G. K.; Scuseria, G. E. Exact parameterization of fermionic wave functions via unitary coupled cluster theory. J. Chem.\ Phys. 2019, 151

2019

[53] [53]

S.; Armaos, V.; Barnes, C

Yordanov, Y. S.; Armaos, V.; Barnes, C. H.; Arvidsson-Shukur, D. R. Qubit-excitation-based adaptive variational quantum eigensolver. Chem.\ Phys. 2021, 4, 228

2021

[54] [54]

Circuit-Efficient Qubit Excitation-Based Variational Quantum Eigensolver

Sun, Z.; Li, X.; Liu, J.; Li, Z.; Yang, J. Circuit-Efficient Qubit Excitation-Based Variational Quantum Eigensolver. J. Chem.\ Theory Comput. 2025, 21, 5071--5082

2025

[55] [55]

Adaptive Variational Quantum Simulations of Periodic Materials Using Qubit-Encoded Wave Functions

Li, X.; Fan, Y.; Liu, J.; Li, Z.; Yang, J. Adaptive Variational Quantum Simulations of Periodic Materials Using Qubit-Encoded Wave Functions. J. Chem.\ Theory Comput. 2025, 21, 5973--5985

2025

[56] [56]

Evaluating analytic gradients on quantum hardware

Schuld, M.; Bergholm, V.; Gogolin, C.; Izaac, J.; Killoran, N. Evaluating analytic gradients on quantum hardware. Phys.\ Rev. A 2019, 99, 032331

2019

[57] [57]

Quantum circuit learning

Mitarai, K.; Negoro, M.; Kitagawa, M.; Fujii, K. Quantum circuit learning. Phys.\ Rev. A 2018, 98, 032309

2018

[58] [58]

J.; Handy, N

Knowles, P. J.; Handy, N. C. A new determinant-based full configuration interaction method. Chem.\ Phys.\ Lett. 1984, 111, 315--321

1984

[59] [59]

O.; Jo/rgensen, P.; Jensen, H

Olsen, J.; Roos, B. O.; Jo/rgensen, P.; Jensen, H. J. A. Determinant based configuration interaction algorithms for complete and restricted configuration interaction spaces. J. Chem.\ Phys. 1988, 89, 2185--2192

1988

[60] [60]

S.; Lidar, D

Wu, L.-A.; Byrd, M. S.; Lidar, D. Polynomial-time simulation of pairing models on a quantum computer. Phys.\ Rev.\ Lett. 2002, 89, 057904

2002

[61] [61]

J.; Thuente, D

Mor\' e , J. J.; Thuente, D. J. Line search algorithms with guaranteed sufficient decrease. ACM Trans. Math. Softw. 1994, 20, 286–307

1994

[62] [62]

W.; Van Neck , D

Wouters, S.; Poelmans, W.; Ayers, P. W.; Van Neck , D. CheMPS2: A free open-source spin-adapted implementation of the density matrix renormalization group for ab initio quantum chemistry. Comput.\ Phys.\ Commun. 2014, 185, 1501--1514

2014

[63] [63]

R.; Economou, S

Grimsley, H. R.; Economou, S. E.; Barnes, E.; Mayhall, N. J. An adaptive variational algorithm for exact molecular simulations on a quantum computer. Nat.\ Chem. 2019, 10

2019

[64] [64]

An efficient quantum algorithm for the time evolution of parameterized circuits

Barison, S.; Vicentini, F.; Carleo, G. An efficient quantum algorithm for the time evolution of parameterized circuits. Quantum 2021, 5, 512

2021

[65] [65]

McLachlan, A. D. A Variational Solution of the Time-Dependent Schr\"odinger Equation. Mol. Phys. 1964, 8, 39--44

1964

[66] [66]

Yuan, X.; Endo, S.; Zhao, Q.; Li, Y.; Benjamin, S. C. Theory of variational quantum simulation. Quantum 2019, 3, 191 mcitethebibliography

2019