arxiv: 2601.02233 · v1 · submitted 2026-01-05 · 🪐 quant-ph · cs.ET· cs.SE· physics.comp-ph

PauliEngine: High-Performant Symbolic Arithmetic for Quantum Operations

Leon M\"uller , Adelina B\"arligea , Alexander Knapp , Jakob S. Kottmann This is my paper

Pith reviewed 2026-05-16 17:42 UTC · model grok-4.3

classification 🪐 quant-ph cs.ETcs.SEphysics.comp-ph

keywords Pauli stringssymbolic arithmeticquantum operatorsbinary symplectic representationC++ frameworkquantum simulationhigh-performance primitives

0 comments

The pith

PauliEngine is a C++ framework that speeds up symbolic arithmetic on Pauli strings for quantum operations via binary symplectic encoding and bit-wise primitives.

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

The paper presents PauliEngine as a high-performance library for the classical side of quantum computations, where fast handling of qubit operators is essential for scalability. It supplies optimized routines for multiplying Pauli strings, computing commutators, tracking symbolic phases, and performing structural changes. These rest on a binary symplectic representation of the strings together with low-level bit operations, and the code is exposed through Python while supporting both numeric and symbolic coefficients. Runtime tests indicate clear gains over existing tools, which matters because hybrid quantum-classical workflows repeatedly manipulate these operators during compilation, simulation, and variational algorithms.

Core claim

PauliEngine supplies efficient primitives for Pauli string multiplication, commutators, symbolic phase tracking, and structural transformations. It is built on a binary symplectic representation together with optimized bit-wise operations, supports numerical and symbolic coefficients, and is exposed through a Python interface, with benchmarks showing substantial speedups over current state-of-the-art implementations.

What carries the argument

Binary symplectic representation of Pauli strings, which stores each string as a pair of binary vectors so that multiplication and commutation reduce to fast bit operations.

If this is right

PauliEngine can serve as a drop-in backend that improves overall runtime for operator-heavy quantum software stacks and simulators.
The same primitives support both numeric coefficients for simulation and symbolic coefficients for circuit compilation or analysis.
Python bindings make the faster C++ core immediately usable inside existing quantum frameworks without rewriting user code.
Larger qubit counts become feasible in classical pre- and post-processing steps that previously formed scaling bottlenecks.

Where Pith is reading between the lines

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

Faster Pauli arithmetic could shorten iteration times inside hybrid algorithms such as variational quantum eigensolvers that rely on repeated operator manipulations.
The same bit-level encoding pattern may transfer to other operator algebras or to GPU kernels for even larger systems.
If the speed gains hold across diverse hardware, libraries that currently use slower Python or generic C++ Pauli handling could adopt this approach as a standard primitive.

Load-bearing premise

The reported benchmarks use representative workloads and fair comparisons without undisclosed optimizations or selective test cases.

What would settle it

Independent re-running of the benchmarks on standard Pauli-operator workloads from quantum simulation libraries shows no meaningful speedup or even slower performance than the compared packages.

Figures

Figures reproduced from arXiv: 2601.02233 by Adelina B\"arligea, Alexander Knapp, Jakob S. Kottmann, Leon M\"uller.

**Figure 1.** Figure 1: Overview over datatypes and operations. ⊕ (0, 0) (1, 0) (0, 1) (1, 1) (0, 0) (0, 0) (1, 0) (0, 1) (1, 1) (1, 0) (1, 0) (0, 0) (1, 1) (0, 1) (0, 1) (0, 1) (1, 1) (0, 0) (1, 0) (1, 1) (1, 1) (0, 1) (1, 0) (0, 0) (17) For multi-qubit Pauli strings, the same logic applies qubit-wise. For example, XY ZXY Z · Y ZXZXY = ZXY Y ZX 101101 011011 · 011110 110101 = 110011 101110. However, the XOR-based multiplication … view at source ↗

**Figure 2.** Figure 2: Coefficient Determination Tables to determine the phase factors arising in the multiplication of two single-qubit [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗

**Figure 3.** Figure 3: Runtime benchmark of DLA computations using [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗

**Figure 4.** Figure 4: Runtime comparison for Hamiltonian multiplication using PauliEngine, [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗

**Figure 5.** Figure 5: Direct comparison between PauliEngine and PauliArray . Left: Mean runtime over 10 runs vs. Hamiltonian size at fixed Pauli string length (500). Right: Mean Runtime over 100 runs vs. Pauli string length at fixed Hamiltonian size (500). PauliArray is faster for small instances, but its runtime grows sharply once memory consumption becomes substantial, whereas PauliEngine maintains stable, with quadratic scal… view at source ↗

read the original abstract

Quantum computation is inherently hybrid, and fast classical manipulation of qubit operators is necessary to ensure scalability in quantum software. We introduce PauliEngine, a high-performance C++ framework that provides efficient primitives for Pauli string multiplication, commutators, symbolic phase tracking, and structural transformations. Built on a binary symplectic representation and optimized bit-wise operations, PauliEngine supports both numerical and symbolic coefficients and is accessible through a Python interface. Runtime benchmarks demonstrate substantial speedups over state-of-the-art implementations. PauliEngine provides a scalable backend for operator-based quantum software tools and simulations.

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

PauliEngine delivers a fast C++ core for Pauli string ops with Python bindings, but the speedup claims need clearer benchmark details to hold up.

read the letter

The key takeaway here is that PauliEngine is a well-engineered C++ library for fast symbolic and numerical Pauli string operations, wrapped for Python use. It builds on the standard binary symplectic representation with bitwise optimizations for things like multiplication and commutators, plus phase tracking. This fills a real need in quantum software where manipulating large numbers of Pauli operators can slow things down in simulations and circuit optimizations. The paper does a good job describing the primitives and how they integrate symbolic coefficients without much overhead. Credit for making it accessible via Python while keeping the core fast. Where it gets shaky is the performance evaluation. The claim of substantial speedups is central, but the abstract gives no specifics on the test cases, comparison libraries, or measurement setup. If the workloads aren't representative or the baselines aren't tuned equivalently, those gains might not translate to typical use. The stress test note on non-representative benchmarks seems worth checking against the full results. Overall, this is aimed at quantum computing practitioners building tools that rely on efficient operator algebra. Someone working on scalable simulators or variational algorithms could find the backend useful. I think it deserves peer review. The implementation is concrete and the problem is practical, so referees can verify the code and benchmarks directly. It might need revisions on the experimental section, but the core contribution is worth the time.

Referee Report

1 major / 1 minor

Summary. The manuscript introduces PauliEngine, a C++ framework for efficient symbolic arithmetic on Pauli operators in quantum computing. It employs a binary symplectic representation with optimized bit-wise primitives to support Pauli string multiplication, commutators, symbolic phase tracking, and structural transformations, while providing a Python interface. The central claim is that runtime benchmarks demonstrate substantial speedups over state-of-the-art implementations.

Significance. If the reported speedups are shown to hold under representative workloads with fair, reproducible baselines, PauliEngine would address a practical scalability bottleneck in hybrid quantum-classical software by supplying a high-performance backend for operator manipulations in simulations and algorithms.

major comments (1)

[Benchmarks] Benchmarks section: The central performance claim rests on runtime benchmarks, yet the manuscript provides no details on hardware platform, compiler flags, optimization levels, input distributions (e.g., Pauli string lengths or densities), or raw timing data for comparisons against Qiskit and Stim. Without these, it is impossible to verify that the reported speedups are generalizable rather than artifacts of selective micro-benchmarks or non-equivalent baselines.

minor comments (1)

[Abstract] Abstract: The phrase 'state-of-the-art implementations' is used without naming the specific libraries (Qiskit, Stim) that are later referenced; explicit naming would improve clarity.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their constructive feedback, which highlights the need for greater transparency in our benchmarks. We agree that additional details are required to substantiate the performance claims and ensure reproducibility. We will revise the manuscript accordingly by expanding the Benchmarks section with the requested information on hardware, compilation settings, input distributions, and raw data.

read point-by-point responses

Referee: [Benchmarks] Benchmarks section: The central performance claim rests on runtime benchmarks, yet the manuscript provides no details on hardware platform, compiler flags, optimization levels, input distributions (e.g., Pauli string lengths or densities), or raw timing data for comparisons against Qiskit and Stim. Without these, it is impossible to verify that the reported speedups are generalizable rather than artifacts of selective micro-benchmarks or non-equivalent baselines.

Authors: We acknowledge that the current manuscript omits these critical details. In the revised version, we will add a new subsection to the Benchmarks section that specifies: (1) the hardware platform (Intel Xeon Gold 6248R CPU, 128 GB RAM, Ubuntu 22.04); (2) compiler and flags (GCC 11.3 with -O3 -march=native); (3) input distributions (uniform random Pauli strings with lengths 10-1000 qubits and densities 0.1-0.9, plus structured cases from VQE and stabilizer simulations); and (4) raw timing tables (mean and std. dev. over 1000 runs) for direct comparison with Qiskit 0.45 and Stim 1.13. These additions will allow independent verification of the reported speedups. revision: yes

Circularity Check

0 steps flagged

No circularity: implementation and empirical benchmarks only

full rationale

The paper introduces a C++ software framework (PauliEngine) for Pauli-string arithmetic using binary-symplectic representation and bit-wise primitives, with a Python interface. Its central claims are performance speedups demonstrated via runtime benchmarks on operations such as multiplication and commutators. No mathematical derivation chain, fitted parameters, predictions, or self-referential definitions exist. Benchmarks are direct empirical measurements rather than outputs of any model that reduces to its own inputs. Self-citations, if present, are not load-bearing for any claimed result. The work is self-contained as a software artifact.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

This is an engineering software contribution; no free parameters, axioms, or invented entities are required for the central claim.

pith-pipeline@v0.9.0 · 5399 in / 849 out tokens · 22245 ms · 2026-05-16T17:42:08.317147+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

binary symplectic representation ... multiplication ... XOR-operation ... phase factor c=i^(|F+|-|F-|) mod 4 ... fast commutator ... parity check on τ mod 2
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

PauliEngine ... high-performance C++ framework ... runtime benchmarks demonstrate substantial speedups

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

Enabling Lie-Algebraic Classical Simulation beyond Free Fermions
quant-ph 2026-04 unverdicted novelty 8.0

New Pauli orbit and modified Gell-Mann bases enable polynomial-cost Lie-algebraic simulation for permutation-equivariant and bounded-excitation quantum dynamics.
Counting anticommuting Pauli pairs in linear time
quant-ph 2026-05 unverdicted novelty 7.0

An O(m) algorithm counts anticommuting unordered pairs of bounded-weight Pauli strings by maintaining labeled subpattern counts and applying a subset zeta identity on each insertion.

Reference graph

Works this paper leans on

49 extracted references · 49 canonical work pages · cited by 2 Pith papers · 2 internal anchors

[1]

Large operators are needed. 2. Parametrized (and differentiable) operators are needed. In other scenarios,PauliArrayandOpenFermioncan offer more convenience as they are solely written in python. VI. CONCLUSION This work introducesPauliEngine, a compact, high- performance C++ backend for symbolic Pauli string arithmetic. By combining a binary symplectic re...

work page
[2]

X. Xu, S. Benjamin, J. Chen, J. Sun, X. Yuan, and P. Zhang, A herculean task: classical sim- ulation of quantum computers, Science Bulletin 10.1016/j.scib.2025.10.016 (2025)

work page doi:10.1016/j.scib.2025.10.016 2025
[3]

P. Rall, D. Liang, J. Cook, and W. Kretschmer, Simu- lation of qubit quantum circuits via pauli propagation, Physical Review A99, 10.1103/physreva.99.062337 (2019)

work page doi:10.1103/physreva.99.062337 2019
[4]

M. S. Rudolph, T. Jones, Y. Teng, A. Angrisani, and Z. Holmes, Pauli propagation: A computational frame- work for simulating quantum systems, arxiv:2505.21606 10.48550/ARXIV.2505.21606 (2025)

work page doi:10.48550/arxiv.2505.21606 2025
[5]

Li and S.-X

Z.-L. Li and S.-X. Zhang, The dual role of low-weight pauli propagation: A flawed simulator but a pow- erful initializer for variational quantum algorithms, arxiv:2508.06358 (2025)

work page arXiv 2025
[6]

M. L. Goh, M. Larocca, L. Cincio, M. Cerezo, and F. Sauvage, Lie-algebraic classical simulations for quantum computing, Physical Review Research7, 10.1103/3y65-f5w6 (2025)

work page doi:10.1103/3y65-f5w6 2025
[7]

Developers, Symengine: Fast symbolic manipulation library (2025)

S. Developers, Symengine: Fast symbolic manipulation library (2025)

work page 2025
[8]

Gidney, Stim: a fast stabilizer circuit simulator, Quantum5, 497 (2021)

C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum5, 497 (2021)

work page 2021
[9]

Higgott and C

O. Higgott and C. Gidney, Sparse Blossom: correcting a million errors per core second with minimum-weight matching, Quantum9, 1600 (2025)

work page 2025
[10]

M. Dion, T. Belabbas, and N. Bastien, Efficiently manipulating pauli strings with pauliarray (2024), arXiv:arxiv:2405.19287 [quant-ph]

work page arXiv 2024
[11]

Jones, A

T. Jones, A. Brown, I. Bush,et al., Quest and high per- formance simulation of quantum computers, Scientific Reports9, 10736 (2019)

work page 2019
[12]

Quantum computing with Qiskit

A. Javadi-Abhari, M. Treinish, K. Krsulich, C. J. Wood, J. Lishman, J. Gacon, S. Martiel, P. D. Nation, L. S. Bishop, A. W. Cross, B. R. Johnson, and J. M. Gambetta, Quantum computing with Qiskit (2024), arXiv:arxiv:2405.08810 [quant-ph]

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

Cirq Developers, Cirq (2025)

work page 2025
[14]

Larocca, S

M. Larocca, S. Thanasilp, S. Wang, K. Sharma, J. Biamonte, P. J. Coles, L. Cincio, J. R. Mc- Clean, Z. Holmes, and M. Cerezo, A review of bar- ren plateaus in variational quantum computing, arXiv preprint arXiv:2405.00781 10.48550/arXiv.2405.00781 (2024)

work page doi:10.48550/arxiv.2405.00781 2024
[15]

Larocca, P

M. Larocca, P. Czarnik, K. Sharma, G. Muraleedharan, P. J. Coles, and M. Cerezo, Diagnosing Barren Plateaus with Tools from Quantum Optimal Control, Quantum 6, 824 (2022)

work page 2022
[16]

Ragone, B

M. Ragone, B. N. Bakalov, F. Sauvage, A. F. Kemper, C. Ortiz Marrero, M. Larocca, and M. Cerezo, A Lie algebraic theory of barren plateaus for deep parame- terized quantum circuits, Nature Communications15, 7172 (2024)

work page 2024
[17]

Fontana, D

E. Fontana, D. Herman, S. Chakrabarti, N. Kumar, R. Yalovetzky, J. Heredge, S. H. Sureshbabu, and M. Pistoia, Characterizing barren plateaus in quantum ans¨ atze with the adjoint representation, Nature Com- munications15, 7171 (2024)

work page 2024
[18]

Cerezo, Martin Larocca, Diego García-Martín, N

M. Cerezo, M. Larocca, D. Garc´ ıa-Mart´ ın, N. L. Diaz, P. Braccia, E. Fontana, M. S. Rudolph, P. Bermejo, A. Ijaz, S. Thanasilp, E. R. Anschuetz, and Z. Holmes, Does provable absence of barren plateaus imply classical simulability?, Nature Communications16, 10.1038/s41467-025-63099-6 (2025)

work page doi:10.1038/s41467-025-63099-6 2025
[19]

PennyLane: Automatic differentiation of hybrid quantum-classical computations

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

work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.1811.04968 2018
[20]

Kottmann, Introducing (dynamical) lie algebras for quantum practitioners, Pennylane Demos (2025)

K. Kottmann, Introducing (dynamical) lie algebras for quantum practitioners, Pennylane Demos (2025)

work page 2025
[21]

J. F. Gonthier, M. D. Radin, C. Buda, E. J. Doskocil, C. M. Abuan, and J. Romero, Measurements as a roadblock to near-term practical quantum advantage in chemistry: Resource analysis, Physical Review Re- search4, 033154 (2022)

work page 2022
[22]

Patel, P

S. Patel, P. Jayakumar, T.-C. Yen, and A. F. Iz- maylov, Quantum measurement for quantum chemistry on a quantum computer, Chemical Reviews125, 7490 (2025)

work page 2025
[23]

Bincoletto and J

D. Bincoletto and J. Kottmann, A physics-informed measurement protocol for expectation values of fermionic observables, Digital Discovery , (2025), DOI:10.1039/D5DD00251F

work page doi:10.1039/d5dd00251f 2025
[24]

Naldesi, A

P. Naldesi, A. Elben, A. Minguzzi, D. Cl´ ement, P. Zoller, and B. Vermersch, Fermionic correlation func- tions from randomized measurements in programmable atomic quantum devices, Physical Review Letters131, 060601 (2023)

work page 2023
[25]

Elben, S

A. Elben, S. T. Flammia, H.-Y. Huang, R. Kueng, J. Preskill, B. Vermersch, and P. Zoller, The random- ized measurement toolbox, Nature Reviews Physics5, 9 (2023)

work page 2023
[26]

T.-C. Yen, V. Verteletskyi, and A. F. Izmaylov, Measur- ing all compatible operators in one series of single-qubit measurements using unitary transformations, Journal of chemical theory and computation16, 2400 (2020)

work page 2020
[27]

Verteletskyi, T.-C

V. Verteletskyi, T.-C. Yen, and A. F. Izmaylov, Mea- surement optimization in the variational quantum eigensolver using a minimum clique cover, The Journal 9 of chemical physics152, 10.1063/5.0004875 (2020)

work page doi:10.1063/5.0004875 2020
[28]

T.-C. Yen, A. Ganeshram, and A. F. Izmaylov, Deter- ministic improvements of quantum measurements with grouping of compatible operators, non-local transfor- mations, and covariance estimates, npj Quantum Infor- mation9, 14 (2023)

work page 2023
[29]

Gresch and M

A. Gresch and M. Kliesch, Guaranteed efficient en- ergy estimation of quantum many-body hamiltonians using shadowgrouping, Nature communications16, 689 (2025)

work page 2025
[30]

Schuld, V

M. Schuld, V. Bergholm, C. Gogolin, J. Izaac, and N. Killoran, Evaluating analytic gradients on quantum hardware, Physical Review A99, 032331 (2019)

work page 2019
[31]

Jones and J

T. Jones and J. Gacon, Efficient calculation of gra- dients in classical simulations of variational quan- tum algorithms, arXiv preprint arXiv:2009.02823 10.48550/arXiv.2009.02823 (2020)

work page doi:10.48550/arxiv.2009.02823 2009
[32]

Anand, P

A. Anand, P. Schleich, S. Alperin-Lea, P. W. Jensen, S. Sim, M. D´ ıaz-Tinoco, J. S. Kottmann, M. Degroote, A. F. Izmaylov, and A. Aspuru-Guzik, A quantum com- puting view on unitary coupled cluster theory, Chemical Society Reviews51, 1659 (2022)

work page 2022
[33]

Bharti and T

K. Bharti and T. Haug, Iterative quantum-assisted eigensolver, Physical Review A104, L050401 (2021)

work page 2021
[34]

Cerezo, A

M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio,et al., Variational quantum algorithms, Na- ture Reviews Physics3, 625 (2021)

work page 2021
[35]

I. G. Ryabinkin, R. A. Lang, S. N. Genin, and A. F. Iz- maylov, Iterative Qubit Coupled Cluster approach with efficient screening of generators, Journal of Chemical Theory and Computation16, 1055 (2020)

work page 2020
[36]

Shang, M.-C

Z.-X. Shang, M.-C. Chen, X. Yuan, C.-Y. Lu, and J.-W. Pan, Schr¨ odinger-heisenberg variational quantum algo- rithms, Physical Review Letters131, 060406 (2023)

work page 2023
[37]

Zhang, L

Y. Zhang, L. Cincio, C. F. Negre, P. Czarnik, P. J. Coles, P. M. Anisimov, S. M. Mniszewski, S. Tretiak, and P. A. Dub, Variational quantum eigensolver with reduced circuit complexity, npj Quantum Information 8, 96 (2022)

work page 2022
[38]

J. Sun, L. Cheng, and W. Li, Toward chemical accu- racy with shallow quantum circuits: A clifford-based hamiltonian engineering approach, Journal of Chemi- cal Theory and Computation20, 695 (2024)

work page 2024
[39]

J. Sun, L. Cheng, and S.-X. Zhang, Stabilizer ground states for simulating quantum many-body physics: the- ory, algorithms, and applications, Quantum9, 1782 (2025)

work page 2025
[40]

Anand and K

A. Anand and K. R. Brown, Stabilizer configuration interaction: Finding molecular subspaces with error detection properties, Physical Review A112, 032421 (2025)

work page 2025
[41]

Dobrautz, I

W. Dobrautz, I. O. Sokolov, K. Liao, P. L. R´ ıos, M. Rahm, A. Alavi, and I. Tavernelli, Toward real chemical accuracy on current quantum hardware through the transcorrelated method, Journal of Chem- ical Theory and Computation20, 4146 (2024)

work page 2024
[42]

I. O. Sokolov, W. Dobrautz, H. Luo, A. Alavi, and I. Tavernelli, Orders of magnitude increased accuracy for quantum many-body problems on quantum com- puters via an exact transcorrelated method, Physical Review Research5, 023174 (2023)

work page 2023
[43]

Kumar, A

A. Kumar, A. Asthana, C. Masteran, E. F. Valeev, Y. Zhang, L. Cincio, S. Tretiak, and P. A. Dub, Quantum simulation of molecular electronic states with a transcorrelated hamiltonian: higher accuracy with fewer qubits, Journal of chemical theory and compu- tation18, 5312 (2022)

work page 2022
[44]

W. J. Huggins, J. Lee, U. Baek, B. O’Gorman, and K. B. Whaley, A non-orthogonal variational quantum eigensolver, New Journal of Physics22, 073009 (2020)

work page 2020
[45]

J. S. Kottmann and F. Scala, Quantum algorithmic approach to multiconfigurational valence bond theory: Insights from interpretable circuit design, Journal of Chemical Theory and Computation20, 3514 (2024)

work page 2024
[46]

N. H. Stair, R. Huang, and F. A. Evangelista, A mul- tireference quantum krylov algorithm for strongly cor- related electrons, Journal of chemical theory and com- putation16, 2236 (2020)

work page 2020
[47]

N. P. Bauman, B. Peng, and K. Kowalski, Coupled- cluster downfolding techniques: A review of existing applications in classical and quantum computing for chemical systems, Advances in Quantum Chemistry87, 141 (2023)

work page 2023
[48]

J. R. McClean, N. C. Rubin, K. J. Sung, I. D. Kivlichan, X. Bonet-Monroig, Y. Cao, C. Dai, E. S. Fried, C. Gid- ney, B. Gimby,et al., Openfermion: the electronic structure package for quantum computers, Quantum Science and Technology5, 034014 (2020)

work page 2020
[49]

Jakob, nanobind: tiny and ef- ficient c++/python bindings (2022), https://github.com/wjakob/nanobind

W. Jakob, nanobind: tiny and ef- ficient c++/python bindings (2022), https://github.com/wjakob/nanobind

work page 2022