pith. machine review for the scientific record. sign in

arxiv: 2604.19625 · v1 · submitted 2026-04-21 · 🪐 quant-ph · cs.CC

Recognition: unknown

Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems

Armando Angrisani, Nikita Guseynov, Zo\"e Holmes

Authors on Pith no claims yet

Pith reviewed 2026-05-10 03:22 UTC · model grok-4.3

classification 🪐 quant-ph cs.CC
keywords bosonic quantum simulationcoherent statesKerr nonlinearityclassical simulabilityBose-Hubbard modelsparse superpositionsquantum circuitsnonlinear optics
0
0 comments X

The pith

Bosonic circuits with logarithmically many Kerr nonlinearities admit quasi-polynomial classical simulation at exponentially small trace-distance error.

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

The paper introduces coherent-state propagation, a method that represents the quantum state of bosonic circuits as a sparse superposition of coherent states and applies controlled approximations to keep the number of terms manageable. It proves that circuits built from displaced linear optics plus Kerr gates remain classically simulable in quasi-polynomial time whenever the number of Kerr operations is only logarithmic, with error that decays exponentially in the trace distance. The same framework yields polynomial runtime in a weak-nonlinearity regime even for arbitrarily small constant precision, while supplying rigorous bounds on both observable estimation and sampling. These results are motivated by and tested on all-to-all Bose-Hubbard dynamics, where the method matches reference data from exact Fock-space and matrix-product-state calculations.

Core claim

The authors present coherent-state propagation as a Schrödinger-picture algorithm that tracks bosonic states under displaced linear optics and Kerr nonlinearities by maintaining a sparse superposition of coherent states. Approximation strategies are introduced to control the growth of this superposition, delivering quasi-polynomial-time classical simulation with exponentially small trace-distance error for circuits containing only logarithmically many Kerr gates. In the weak-nonlinearity regime the runtime becomes polynomial for any fixed constant precision, with explicit guarantees for both expectation-value estimation and sampling.

What carries the argument

Coherent-state propagation, which evolves the state as a sparse superposition of coherent states while using approximation strategies to bound the number of terms when Kerr nonlinearities are few or weak.

If this is right

  • Bosonic circuits with only logarithmically many Kerr gates can be simulated classically in quasi-polynomial time at exponentially small trace-distance error.
  • In the weak-nonlinearity regime the simulation runtime remains polynomial for any fixed constant precision.
  • The framework supplies rigorous error bounds for both observable estimation and sampling from the final state.
  • Numerical performance on all-to-all Bose-Hubbard models matches exact Fock-basis and matrix-product-state references.

Where Pith is reading between the lines

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

  • The agreement with matrix-product-state data on all-to-all models indicates the method can serve as a practical alternative where tensor-network techniques face high entanglement across distant sites.
  • Because the underlying gate set is universal for bosonic computation, the results delineate a concrete regime in which quantum advantage over classical simulation is unlikely to appear.
  • Similar sparsity-preserving approximations may extend the approach to other bosonic nonlinearities or to continuous-time driven-dissipative models.

Load-bearing premise

The evolving quantum state can be kept representable as a sparse superposition of coherent states without the approximation error growing uncontrollably.

What would settle it

A concrete bosonic circuit containing a logarithmic number of Kerr gates for which the number of coherent states required to maintain exponentially small trace-distance error grows super-quasi-polynomially.

Figures

Figures reproduced from arXiv: 2604.19625 by Armando Angrisani, Nikita Guseynov, Zo\"e Holmes.

Figure 1
Figure 1. Figure 1: Schematic of universal Gaussian+Kerr circuit architecture. The input state is represented as a fi￾nite superposition of multimode coherent-product states, Eq. (5). Each layer consists of a displaced passive linear￾optics (DPLO) unitary UDPLO followed by a local Kerr gate Kκ = e iκnˆ 2 , which induces branching in the coherent￾state representation. After L such layers, an arbitrary Gaussian unitary UG acts … view at source ↗
Figure 2
Figure 2. Figure 2: A visualization of coherent-state propagation in the regime of weak non-Gaussianity. In this regime, the Kerr gate is approximated by the two-term update |α⟩ 7→ cos ϑ |α⟩ − isin ϑ |−α⟩ with |sin ϑ| ≪ | cos ϑ|; see Appendix C 2. For visual clarity, only the coherent state in the first qumode, where the Kerr gate acts, is shown. The branches carrying too many factors of sin are truncated as less contributing… view at source ↗
Figure 3
Figure 3. Figure 3: Benchmarking against exact Fock-basis simulation. Comparison between coherent-state propagation and the exact Fock-basis simulation for representative observables in the three-mode driven Bose–Hubbard model with all-to-all connectivity; see Appendix E. Panels (a)–(c) show the time evolution of ⟨Xˆ 1⟩, ⟨Xˆ 1Xˆ 2⟩, and ⟨Xˆ 1Pˆ 1 + Pˆ 1Xˆ 1⟩, respectively. The inset in each panel shows the absolute error. The… view at source ↗
Figure 4
Figure 4. Figure 4: Benchmarking against MPS simulation. Here we consider an m = 6 Bose-Hubbard system with an all-to-all topology. (a) Time evolution of ⟨Xˆ 0Xˆ 1⟩ and the corresponding absolute error for coefficient truncation parameter S = 212 and M = 3. (b) Relative error of ⟨Xˆ 2 0 ⟩ at T = 1 as a function of the cutoff S. (c) Same as (b) for ⟨Xˆ 0Xˆ 1⟩. Here M controls the number of terms in the expansion Kκ |α⟩, see Ap… view at source ↗
Figure 5
Figure 5. Figure 5: Schematic of the first-order Lie–Trotterized evolution in Eq. ( [PITH_FULL_IMAGE:figures/full_fig_p049_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Diagnostics of the coherent amplitudes in the coherent-state propagation for the three-mode driven Bose– [PITH_FULL_IMAGE:figures/full_fig_p052_6.png] view at source ↗
read the original abstract

We introduce coherent-state propagation, a computational framework for simulating bosonic systems. We focus on bosonic circuits composed of displaced linear optics augmented by Kerr nonlinearities, a universal model of bosonic quantum computation that is also physically motivated by driven Bose-Hubbard dynamics. The method works in the Schr\"odinger picture representing the evolving state as a sparse superposition of coherent states. We develop approximation strategies that keep the simulation cost tractable in physically relevant regimes, notably when the number of Kerr gates is small or the Kerr nonlinearities are weak, and prove rigorous guarantees for both observable estimation and sampling. In particular, bosonic circuits with logarithmically many Kerr gates admit quasi-polynomial-time classical simulation at exponentially small error in trace distance. We further identify a weak-nonlinearity regime in which the runtime is polynomial for arbitrarily small constant precision. We complement these results with numerical benchmarks on the Bose-Hubbard model with all-to-all connectivity. The method reproduces Fock-basis and matrix-product-state reference data, suggesting that it offers a useful route to the classical simulation of bosonic systems.

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.

Referee Report

1 major / 1 minor

Summary. The manuscript introduces coherent-state propagation as a framework for classically simulating bosonic quantum circuits composed of displaced linear optics and Kerr nonlinearities. States are represented as sparse superpositions of coherent states in the Schrödinger picture. Approximation strategies are developed to maintain tractable cost when the number of Kerr gates is small or nonlinearities weak, with rigorous guarantees proved for observable estimation and sampling. The central result is that circuits with logarithmically many Kerr gates admit quasi-polynomial-time simulation at exponentially small trace-distance error. Numerical benchmarks on the all-to-all Bose-Hubbard model are included, reproducing Fock-basis and MPS reference data.

Significance. If the sparsity maintenance and error bounds hold, the framework supplies a new classical simulation route for bosonic systems in physically motivated regimes, complementing Fock-space and tensor-network methods for driven Bose-Hubbard dynamics and bosonic quantum computation. The explicit rigorous guarantees for estimation/sampling together with the numerical validation constitute a clear strength.

major comments (1)
  1. [Proof of the main simulation result] The section proving the main simulation theorem (quasi-polynomial runtime at exp-small trace distance for log-many Kerr gates): the claim requires that each Kerr gate applied to a coherent-state superposition can be replaced by a new superposition whose support grows only mildly while the per-gate trace-distance error remains small enough that the total error after logarithmically many gates stays exponentially small. The truncation or sampling rule replacing the exact (generally infinite) post-Kerr state must be accompanied by an explicit global error analysis, including how local truncation errors are bounded and whether a union bound or similar argument controls accumulation over the log gates; without this the quasi-polynomial claim at the stated error level is not yet load-bearing.
minor comments (1)
  1. [Abstract] The abstract could more precisely delineate the weak-nonlinearity regime in which polynomial runtime is achieved for constant precision.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for identifying an area where the proof presentation can be strengthened. We address the single major comment below and have revised the manuscript to incorporate an explicit global error analysis.

read point-by-point responses

  1. Referee: [Proof of the main simulation result] The section proving the main simulation theorem (quasi-polynomial runtime at exp-small trace distance for log-many Kerr gates): the claim requires that each Kerr gate applied to a coherent-state superposition can be replaced by a new superposition whose support grows only mildly while the per-gate trace-distance error remains small enough that the total error after logarithmically many gates stays exponentially small. The truncation or sampling rule replacing the exact (generally infinite) post-Kerr state must be accompanied by an explicit global error analysis, including how local truncation errors are bounded and whether a union bound or similar argument controls accumulation over the log gates; without this the quasi-polynomial claim at the stated error level is not yet load-bearing.

    Authors: We agree that an explicit global error analysis strengthens the presentation. The manuscript already establishes a per-gate trace-distance bound (via truncation of the post-Kerr coherent-state expansion to a finite support whose size grows mildly with the desired local accuracy) and shows that the total error after L gates can be controlled when L is logarithmic. To make the accumulation argument fully explicit, we have added a dedicated subsection that (i) recalls the local truncation error bound, (ii) applies a union bound over the logarithmic number of gates to control the probability that any local error exceeds its target, and (iii) converts the resulting per-gate failure probability into an overall trace-distance guarantee that remains exponentially small. The revised proof therefore directly supports the quasi-polynomial runtime claim at the stated error level. We have also updated the theorem statement to reference this new subsection for clarity. revision: yes

Circularity Check

0 steps flagged

No circularity: derivation introduces new coherent-state propagation framework with independent rigorous error bounds on approximations.

full rationale

The paper defines a new simulation method representing states as sparse coherent-state superpositions, develops explicit approximation strategies for Kerr gates, and proves guarantees for quasi-polynomial runtime at exponentially small trace-distance error when the number of Kerr gates is logarithmic. These bounds rest on standard properties of coherent states under linear optics and controlled truncation of the post-Kerr support, without reducing any central claim to a fitted parameter, self-referential definition, or load-bearing self-citation. The abstract and claimed results are self-contained against external benchmarks such as Fock-basis and MPS references, satisfying the criteria for an honest non-finding.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The framework rests on standard quantum optics concepts and domain assumptions about state sparsity under approximations; no free parameters or invented entities are introduced in the abstract.

axioms (2)
  • standard math Coherent states form a valid overcomplete basis for bosonic Hilbert space with standard overlap and displacement properties
    The representation of evolving states as superpositions relies on these established properties of coherent states.
  • domain assumption The state superposition remains sufficiently sparse under the approximation strategies in the targeted regimes
    This assumption is invoked to ensure tractable simulation cost when Kerr gates are few or weak.

pith-pipeline@v0.9.0 · 5491 in / 1473 out tokens · 55921 ms · 2026-05-10T03:22:00.923096+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Quantum state isomorphism problems for groups

    quant-ph 2026-05 unverdicted novelty 8.0

    Quantum state isomorphism under group actions is BQP-hard for pure states across nontrivial groups and QSZK-complete for mixed states with finite groups; Pauli group version is BQP-complete and Clifford is GI-hard, ru...

Reference graph

Works this paper leans on

300 extracted references · 125 canonical work pages · cited by 1 Pith paper · 2 internal anchors

  1. [1]

    LaRacuente and F

    Approximate Unitary k -Designs from Shallow, Low-Communication Circuits , author=. arXiv preprint arXiv:2407.07876 , year=

    work page arXiv

  2. [2]

    High-order magnus expansion for hamilto- nian simulation, 2025

    High-order magnus expansion for Hamiltonian simulation , author=. arXiv preprint arXiv:2509.06054 , year=

    work page arXiv

  3. [3]

    Grevink, J

    Will it glue? On short-depth designs beyond the unitary group , author=. arXiv preprint arXiv:2506.23925 , url=. doi:10.48550/arXiv.2506.23925 , year=

    work page doi:10.48550/arxiv.2506.23925

  4. [4]

    arXiv preprint arXiv:2511.02904 , year=

    Classical shadows for sample-efficient measurements of gauge-invariant observables , author=. arXiv preprint arXiv:2511.02904 , year=

    work page arXiv

  5. [5]

    arXiv preprint arXiv:2512.19413 , year=

    Clifford Volume and Free Fermion Volume: Complementary Scalable Benchmarks for Quantum Computers , author=. arXiv preprint arXiv:2512.19413 , year=

    work page arXiv

  6. [6]

    Communications in mathematical physics , volume=

    The spectra of quantum states and the Kronecker coefficients of the symmetric group , author=. Communications in mathematical physics , volume=. 2006 , publisher=

    2006

  7. [7]

    II , author=

    A new approach to the representation theory of the symmetric groups. II , author=. Journal of Mathematical Sciences , volume=. 2005 , publisher=

    2005

  8. [8]

    Handbook of algebra , volume=

    Gelfand--Tsetlin bases for classical Lie algebras , author=. Handbook of algebra , volume=. 2006 , publisher=

    2006

  9. [9]

    Physical Review Letters , volume=

    Clifford dressed time-dependent variational principle , author=. Physical Review Letters , volume=. 2025 , publisher=

    2025

  10. [10]

    Physical Review Letters , volume=

    Stabilizer tensor networks with magic state injection , author=. Physical Review Letters , volume=. 2025 , publisher=

    2025

  11. [11]

    Physical Review A , volume=

    Doped stabilizer states in many-body physics and where to find them , author=. Physical Review A , volume=. 2024 , publisher=

    2024

  12. [12]

    Physical Review Letters , volume=

    Clifford circuits augmented time-dependent variational principle , author=. Physical Review Letters , volume=. 2025 , publisher=

    2025

  13. [13]

    Physical Review X , volume=

    Efficient classical simulation of random shallow 2D quantum circuits , author=. Physical Review X , volume=. 2022 , publisher=

    2022

  14. [14]

    Physical Review Letters , volume=

    Hybrid stabilizer matrix product operator , author=. Physical Review Letters , volume=. 2024 , publisher=

    2024

  15. [15]

    Physical Review Letters , volume=

    Stabilizer tensor networks: universal quantum simulator on a basis of stabilizer states , author=. Physical Review Letters , volume=. 2024 , publisher=

    2024

  16. [16]

    International Conference on Theory and Applications of Satisfiability Testing , pages=

    Open-WBO: A modular MaxSAT solver , author=. International Conference on Theory and Applications of Satisfiability Testing , pages=. 2014 , organization=

    2014

  17. [17]

    Physical Review B , volume=

    Quantifying nonstabilizerness of matrix product states , author=. Physical Review B , volume=. 2023 , publisher=

    2023

  18. [18]

    Quantum , volume=

    Critical behaviors of non-stabilizerness in quantum spin chains , author=. Quantum , volume=. 2024 , publisher=

    2024

  19. [19]

    Physical Review A , volume=

    Bipartite representations and many-body entanglement of pure states of N indistinguishable particles , author=. Physical Review A , volume=. 2024 , publisher=

    2024

  20. [20]

    Physical Review B , volume=

    Nontransverse factorizing fields and entanglement in finite spin systems , author=. Physical Review B , volume=. 2015 , publisher=

    2015

  21. [21]

    arXiv preprint arXiv:2512.05151 , year=

    Quantum machine learning -- lecture notes , author=. arXiv preprint arXiv:2512.05151 , year=

    work page arXiv

  22. [22]

    Physical Review B , volume=

    Stabilizer entropy and entanglement complexity in the Sachdev-Ye-Kitaev model , author=. Physical Review B , volume=. 2025 , publisher=

    2025

  23. [23]

    Sierant, P

    Fermionic Magic Resources of Quantum Many-Body Systems , author=. arXiv preprint arXiv:2506.00116 , year=

    work page arXiv

  24. [24]

    SciPost Phys

    Efficient mutual magic and magic capacity with matrix product states , author=. SciPost Phys. , volume=. 2025 , publisher=. doi:10.21468/SciPostPhys.19.4.085 , url=

    work page doi:10.21468/scipostphys.19.4.085 2025

  25. [25]

    arXiv preprint arXiv:2504.19750 , year=

    Non-stabilizerness generation in a multi-particle quantum walk , author=. arXiv preprint arXiv:2504.19750 , year=

    work page arXiv

  26. [26]

    arXiv preprint arXiv:2504.09360 , year=

    An exact link between nonlocal magic and operator entanglement , author=. arXiv preprint arXiv:2504.09360 , year=

    work page arXiv

  27. [27]

    Physical Review Letters , volume=

    Nonstabilizerness via perfect pauli sampling of matrix product states , author=. Physical Review Letters , volume=. 2023 , publisher=

    2023

  28. [28]

    Collura, J

    The quantum magic of fermionic Gaussian states , author=. arXiv preprint arXiv:2412.05367 , year=

    work page arXiv

  29. [29]

    PRX Quantum , volume=

    Magic-induced computational separation in entanglement theory , author=. PRX Quantum , volume=. 2025 , publisher=

    2025

  30. [30]

    Nature Machine Intelligence , volume=

    Quantum circuit optimization with alphatensor , author=. Nature Machine Intelligence , volume=. 2025 , publisher=

    2025

  31. [31]

    Graph-theoretic Simplification of Quantum Circuits with the

    Duncan, Ross and Kissinger, Aleks and Perdrix, Simon and Van De Wetering, John , journal=. Graph-theoretic Simplification of Quantum Circuits with the. 2020 , publisher=

    2020

  32. [32]

    Nature Reviews Physics , pages=

    Tensor networks for quantum computing , author=. Nature Reviews Physics , pages=. 2025 , publisher=

    2025

  33. [33]

    Physical Review B , volume=

    Variational optimization algorithms for uniform matrix product states , author=. Physical Review B , volume=. 2018 , publisher=

    2018

  34. [34]

    Physical Review Letters , volume=

    Learning fermionic correlations by evolving with random translationally invariant Hamiltonians , author=. Physical Review Letters , volume=. 2024 , publisher=

    2024

  35. [35]

    arXiv preprint arXiv:1907.08163 , year=

    A condition under which classical simulability implies efficient state learnability , author=. arXiv preprint arXiv:1907.08163 , year=

    work page arXiv 1907

  36. [36]

    Quantum , volume=

    PAC-learning of free-fermionic states is NP-hard , author=. Quantum , volume=. 2025 , publisher=

    2025

  37. [37]

    Bittel, J

    A complete theory of the Clifford commutant , author=. arXiv preprint arXiv:2504.12263 , year=

    work page arXiv

  38. [38]

    Theoretical computer science , volume=

    The complexity of computing the permanent , author=. Theoretical computer science , volume=. 1979 , publisher=

    1979

  39. [39]

    ACM Transactions on Algorithms (TALG) , volume=

    Generic quantum Fourier transforms , author=. ACM Transactions on Algorithms (TALG) , volume=. 2006 , publisher=

    2006

  40. [40]

    Entropy , volume=

    Simultaneous Measurements of Noncommuting Observables: Positive Transformations and Instrumental Lie Groups , author=. Entropy , volume=. 2023 , publisher=

    2023

  41. [41]

    Physical review letters , volume=

    Optimal pure-state qubit tomography via sequential weak measurements , author=. Physical review letters , volume=. 2018 , publisher=

    2018

  42. [42]

    How to perform the coherent measurement of a curved phase space by continuous isotropic measurement

    Jackson, Christopher S and Caves, Carlton M , journal=. How to perform the coherent measurement of a curved phase space by continuous isotropic measurement. I. Spin and the Kraus-operator geometry of. 2023 , publisher=

    2023

  43. [43]

    Numerical Linear Algebra with Applications , volume=

    Eigenvector sensitivity under general and structured perturbations of tridiagonal Toeplitz-type matrices , author=. Numerical Linear Algebra with Applications , volume=. 2019 , publisher=

    2019

  44. [44]

    Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=

    Positivity of the symmetric group characters is as hard as the polynomial time hierarchy , author=. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=. 2023 , organization=

    2023

  45. [45]

    Journal of Algebraic Combinatorics , volume=

    On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients , author=. Journal of Algebraic Combinatorics , volume=. 2006 , publisher=

    2006

  46. [46]

    Advances in Applied Mathematics , volume=

    Sparse interpolation of symmetric polynomials , author=. Advances in Applied Mathematics , volume=. 1997 , publisher=

    1997

  47. [47]

    Physical Review Letters , volume=

    Model-Independent Learning of Quantum Phases of Matter with Quantum Convolutional Neural Networks , author=. Physical Review Letters , volume=. 2023 , publisher=

    2023

  48. [48]

    arXiv preprint arXiv:2402.08606 , year=

    Arbitrary Polynomial Separations in Trainable Quantum Machine Learning , author=. arXiv preprint arXiv:2402.08606 , year=

    work page arXiv

  49. [49]

    Quantum , volume=

    Convergence and quantum advantage of Trotterized MERA for strongly-correlated systems , author=. Quantum , volume=. 2025 , publisher=

    2025

  50. [50]

    PRX Quantum , volume =

    Quantum Convolutional Neural Networks are Effectively Classically Simulable , author =. PRX Quantum , volume =. 2026 , month =. doi:10.1103/8qt9-72ts , url =

    work page doi:10.1103/8qt9-72ts 2026

  51. [51]

    Deep Autoregressive Models for the Efficient Variational Simulation of Many-Body Quantum Systems , author =. Phys. Rev. Lett. , volume =. 2020 , month =. doi:10.1103/PhysRevLett.124.020503 , url =

    work page doi:10.1103/physrevlett.124.020503 2020

  52. [52]

    Journal of the ACM (JACM) , volume=

    Efficient noise-tolerant learning from statistical queries , author=. Journal of the ACM (JACM) , volume=. 1998 , publisher=

    1998

  53. [53]

    On the Role of Entanglement and Statistics in Learning , url =

    Arunachalam, Srinivasan and Havlicek, Vojtech and Schatzki, Louis , booktitle =. On the Role of Entanglement and Statistics in Learning , url =. doi:10.5555/3666122.3668526 , volume =

    work page doi:10.5555/3666122.3668526

  54. [54]

    A survey on the complexity of learning quantum states , url =

    Anshu, Anurag and Arunachalam, Srinivasan , date =. A survey on the complexity of learning quantum states , url =. Nature Reviews Physics , number =. 2024 , bdsk-url-1 =. doi:10.1038/s42254-023-00662-4 , id =

    work page doi:10.1038/s42254-023-00662-4 2024

  55. [55]

    Linear algebra and its applications , volume=

    Computing a nearest symmetric positive semidefinite matrix , author=. Linear algebra and its applications , volume=. 1988 , publisher=

    1988

  56. [56]

    18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023) , pages=

    Optimal Algorithms for Learning Quantum Phase States , author=. 18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023) , pages=. 2023 , organization=

    2023

  57. [57]

    arXiv preprint arXiv:2002.08240 , year=

    Quantum statistical query learning , author=. arXiv preprint arXiv:2002.08240 , year=

    work page arXiv 2002

  58. [58]

    Physical Review A , volume=

    Shortcuts to the quantum approximate optimization algorithm , author=. Physical Review A , volume=. 2022 , publisher=

    2022

  59. [59]

    Quantum , volume=

    Fermionic wave packet scattering: a quantum computing approach , author=. Quantum , volume=. 2025 , publisher=

    2025

  60. [60]

    Physical Review Research , volume=

    Digitized-counterdiabatic quantum approximate optimization algorithm , author=. Physical Review Research , volume=. 2022 , publisher=. doi:10.1103/PhysRevResearch.4.013141 , url =

    work page doi:10.1103/physrevresearch.4.013141 2022

  61. [61]

    Quantum speedups in solving near- symmetric optimization problems by low-depth qaoa.arXiv preprint arXiv:2411.04979, 2024

    Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA , author=. arXiv preprint arXiv:2411.04979 , year=

    work page arXiv

  62. [62]

    PRX Quantum , volume =

    Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm , author =. PRX Quantum , volume =. 2024 , month =. doi:10.1103/PRXQuantum.5.030348 , url =

    work page doi:10.1103/prxquantum.5.030348 2024

  63. [63]

    Analysis of boolean functions

    Analysis of boolean functions , author=. arXiv preprint arXiv:2105.10386 , year=

    work page arXiv

  64. [64]

    Convergence of digitized-counterdiabatic QAOA: circuit depth versus free parameters , url =

    Mara Vizzuso and Gianluca Passarelli and Giovanni Cantele and Procolo Lucignano , doi =. Convergence of digitized-counterdiabatic QAOA: circuit depth versus free parameters , url =. New Journal of Physics , month =. 2024 , bdsk-url-1 =

    2024

  65. [65]

    Parameter concentrations in quantum approximate optimization , author =. Phys. Rev. A , volume =. 2021 , month =. doi:10.1103/PhysRevA.104.L010401 , url =

    work page doi:10.1103/physreva.104.l010401 2021

  66. [66]

    Dynamical Isometry and a Mean Field Theory of

    Xiao, Lechao and Bahri, Yasaman and Sohl-Dickstein, Jascha and Schoenholz, Samuel and Pennington, Jeffrey , booktitle =. Dynamical Isometry and a Mean Field Theory of. 2018 , editor =

    2018

  67. [67]

    and Bartakke, Prashant P

    Narkhede, Meenal V. and Bartakke, Prashant P. and Sutaone, Mukul S. , date =. A review on weight initialization strategies for neural networks , url =. Artificial Intelligence Review , number =. 2022 , bdsk-url-1 =. doi:10.1007/s10462-021-10033-z , id =

    work page doi:10.1007/s10462-021-10033-z 2022

  68. [68]

    Dynamical Isometry and a Mean Field Theory of

    Chen, Minmin and Pennington, Jeffrey and Schoenholz, Samuel , booktitle =. Dynamical Isometry and a Mean Field Theory of. 2018 , editor =

    2018

  69. [69]

    Exact solutions to the nonlinear dynamics of learning in deep linear neural networks

    Exact solutions to the nonlinear dynamics of learning in deep linear neural networks , author=. arXiv preprint arXiv:1312.6120 , year=

    work page Pith review arXiv

  70. [70]

    arXiv preprint arXiv:2409.16369 , year=

    Exact gradients for linear optics with single photons , author=. arXiv preprint arXiv:2409.16369 , year=

    work page arXiv

  71. [71]

    and Bridges, C

    Banerjee, A. and Bridges, C. A. and Yan, J. -Q. and Aczel, A. A. and Li, L. and Stone, M. B. and Granroth, G. E. and Lumsden, M. D. and Yiu, Y. and Knolle, J. and Bhattacharjee, S. and Kovrizhin, D. L. and Moessner, R. and Tennant, D. A. and Mandrus, D. G. and Nagler, S. E. , Da =. Proximate Kitaev quantum spin liquid behaviour in a honeycomb magnet , Ty ...

    work page doi:10.1038/nmat4604 2016

  72. [72]

    Bridges and Matthew B

    Arnab Banerjee and Jiaqiang Yan and Johannes Knolle and Craig A. Bridges and Matthew B. Stone and Mark D. Lumsden and David G. Mandrus and David A. Tennant and Roderich Moessner and Stephen E. Nagler , title =. Science , volume =. 2017 , doi =. https://www.science.org/doi/pdf/10.1126/science.aah6015 , abstract =

    work page doi:10.1126/science.aah6015 2017

  73. [73]

    Localized Magnetic Excitations in the Fully Frustrated Dimerized Magnet

    Kurita, Nobuyuki and Yamamoto, Daisuke and Kanesaka, Takuya and Furukawa, Nobuo and Ohira-Kawamura, Seiko and Nakajima, Kenji and Tanaka, Hidekazu , journal =. Localized Magnetic Excitations in the Fully Frustrated Dimerized Magnet. 2019 , month =. doi:10.1103/PhysRevLett.123.027206 , url =

    work page doi:10.1103/physrevlett.123.027206 2019

  74. [74]

    Stabilization mechanism for many-body localization in two dimensions , author =. Phys. Rev. Res. , volume =. 2023 , month =. doi:10.1103/PhysRevResearch.5.L032011 , url =

    work page doi:10.1103/physrevresearch.5.l032011 2023

  75. [75]

    Journal of Mathematical Physics , volume=

    Representations of the multi-qubit Clifford group , author=. Journal of Mathematical Physics , volume=. 2018 , publisher=

    2018

  76. [76]

    Classification of dynamical lie algebras generated by spin interactions on undirected graphs,

    Classification of dynamical Lie algebras generated by spin interactions on undirected graphs , author=. arXiv preprint arXiv:2409.19797 , year=

    work page arXiv

  77. [77]

    npj Quantum Information , volume=

    Classification of dynamical Lie algebras of 2-local spin systems on linear, circular and fully connected topologies , author=. npj Quantum Information , volume=. 2024 , publisher=

    2024

  78. [78]

    Quantum Machine Intelligence , volume=

    Exploiting symmetries in nuclear Hamiltonians for ground state preparation , author=. Quantum Machine Intelligence , volume=. 2025 , publisher=

    2025

  79. [79]

    Science , volume=

    Quantum monte carlo , author=. Science , volume=. 1986 , publisher=

    1986

  80. [80]

    Physical Review B , volume=

    Sign problem in the numerical simulation of many-electron systems , author=. Physical Review B , volume=. 1990 , publisher=

    1990

Showing first 80 references.