arxiv: 2604.18720 · v1 · submitted 2026-04-20 · 🪐 quant-ph

Recognition: unknown

Exponentially-improved effective descriptions of physical bosonic systems

Varun Upreti , Nicol\'as Quesada , Ulysse Chabaud

Authors on Pith no claims yet

Pith reviewed 2026-05-10 04:37 UTC · model grok-4.3

classification 🪐 quant-ph

keywords effective dimensionbosonic systemsenergy conditionGaussian dynamicsclassical simulationquantum circuitsKerr gates

0 comments

The pith

A natural energy condition reduces the effective dimension for bosonic quantum states from quadratic to logarithmic scaling in 1/ε.

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

The paper shows that approximating generic bosonic states to precision ε normally requires an effective dimension scaling as 1/ε². It identifies a natural energy condition that improves the scaling exponentially to log(1/ε). The authors prove that most bosonic states satisfy this condition, especially those arising from Gaussian dynamics combined with energy-preserving operations such as the outputs of universal bosonic quantum circuits. This result yields improved learning algorithms for bosonic states and new classical simulation algorithms for broad classes of bosonic systems, with further refinements for universal circuits obtained by decomposing Kerr gates into sums of Gaussian gates.

Core claim

The authors identify a natural energy condition which allows the effective dimension scaling to improve exponentially to log(1/ε). They prove that most bosonic quantum states satisfy this condition, and in particular those produced by combining Gaussian dynamics with generic energy-preserving dynamics, which include the output states of universal bosonic quantum circuits. They apply this to enhance learning algorithms for bosonic quantum states, obtain new classical simulation algorithms for a large class of bosonic systems, and refine the simulations for universal circuits using efficient decompositions of Kerr gates as sums of Gaussian gates.

What carries the argument

The natural energy condition on bosonic states that bounds their support in Fock space and enables the logarithmic effective-dimension scaling.

If this is right

Learning algorithms for bosonic quantum states achieve better scaling with the energy condition.
New classical simulation algorithms become available for a large class of bosonic systems.
Classical simulation of universal bosonic quantum circuits is refined using Kerr-gate decompositions into Gaussian gates.
Physical bosonic systems admit efficient high-precision descriptions once the energy condition holds.

Where Pith is reading between the lines

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

The improved scaling may make many practical continuous-variable quantum optics experiments more amenable to classical simulation than previously expected.
Similar energy-based restrictions could be explored for other continuous-variable systems to obtain comparable dimension reductions.
Hardware designers for bosonic quantum processors might target operations that naturally preserve the identified energy condition.

Load-bearing premise

The identified energy condition is natural, physically relevant, and satisfied by the broad class of states generated by Gaussian plus energy-preserving dynamics including universal circuit outputs.

What would settle it

A concrete bosonic state produced by Gaussian dynamics followed by energy-preserving operations whose effective dimension still scales as 1/ε² rather than log(1/ε) at high precision.

Figures

Figures reproduced from arXiv: 2604.18720 by Nicol\'as Quesada, Ulysse Chabaud, Varun Upreti.

**Figure 1.** Figure 1: Exponentially reduced effective dimension of physical bosonic quantum states. While energy-based cutoffs for bosonic states lead to an effective dimension scaling as 1/ϵ2 [21] in terms of the desired precision ϵ, we consider the set S of states with bounded exponential-energy (Definition 1) as a physically relevant class of bosonic quantum states, and show that the effective dimension of any |ψ⟩ ∈ S scales… view at source ↗

read the original abstract

The effective description of a bosonic quantum system identifies the minimum finite dimension required to capture its essential dynamics. This effective dimension plays an important role in the complexity of classical and quantum algorithms for learning and simulating bosonic systems. While generic bosonic states require a dimension scaling as $1/\epsilon^2$ for a precision of approximation $\epsilon$, here we identify a natural energy condition which allows us to improve this scaling exponentially to $\log(1/\epsilon)$. We then prove that most bosonic quantum states satisfy this condition, and in particular those produced by combining Gaussian dynamics with generic energy-preserving dynamics, which include the output states of universal bosonic quantum circuits. We apply this finding to enhance learning algorithms for bosonic quantum states and we further obtain new classical simulation algorithms for a large class of bosonic systems. Finally, using efficient decompositions of Kerr gates as sums of Gaussian gates, we significantly refine these classical simulation algorithms for universal bosonic quantum circuits. Our results demonstrate that physical bosonic systems are significantly more well-behaved than previously assumed, allowing for efficient descriptions even at high precision.

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

A natural energy condition cuts effective dimension for bosonic states from 1/ε² down to log(1/ε) and covers most states from Gaussian plus energy-preserving dynamics, including universal circuit outputs.

read the letter

The central result is that a specific energy condition on bosonic states improves the effective dimension scaling exponentially, from the usual 1/ε² to log(1/ε) for precision ε. The paper proves this condition holds for most bosonic states and in particular for those generated by Gaussian operations combined with generic energy-preserving ones, which includes outputs of universal bosonic circuits. They then use it to tighten learning algorithms for bosonic states and to build new classical simulation algorithms, with further gains from decomposing Kerr gates into sums of Gaussian gates.

Referee Report

0 major / 2 minor

Summary. The paper claims to identify a natural energy condition that improves the effective dimension scaling for bosonic quantum systems from O(1/ε²) to O(log(1/ε)) for approximation error ε. It proves that most bosonic states satisfy this condition, in particular those generated by combining Gaussian dynamics with generic energy-preserving dynamics, including outputs of universal bosonic quantum circuits. The finding is applied to enhance learning algorithms for bosonic states and to derive new classical simulation algorithms, with further improvements using efficient decompositions of Kerr gates into sums of Gaussian gates.

Significance. If the mathematical proofs hold, this work is significant for the field of bosonic quantum information. It demonstrates that physical bosonic systems admit exponentially better effective descriptions than the generic case, leading to more efficient algorithms for learning and simulation. Credit is due to the proofs of the improved scaling and the prevalence of the energy condition among relevant states, as well as the concrete algorithmic applications and the refinement for universal circuits.

minor comments (2)

The motivation for the effective dimension in the context of algorithm complexity could be expanded with a specific example of how 1/ε² scaling limits current methods.
Ensure all mathematical symbols are defined upon first use, particularly those related to the energy condition.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of our manuscript, recognition of its significance for bosonic quantum information, and recommendation for minor revision. We are pleased that the improved effective dimension scaling under the natural energy condition, its prevalence in physical states including universal circuit outputs, and the resulting algorithmic applications were viewed favorably.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper's derivation chain consists of mathematical proofs establishing a natural energy condition that yields log(1/ε) effective-dimension scaling, followed by proofs that this condition holds for most bosonic states (including those from Gaussian plus energy-preserving dynamics). These steps are self-contained against external benchmarks and do not reduce by construction to fitted inputs, self-definitions, or load-bearing self-citations. Algorithmic applications follow directly from the proven bounds without renaming known results or smuggling ansatzes. The central claims rest on independent mathematical content rather than circular reductions.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the mathematical identification and proof of a natural energy condition that yields the improved scaling, plus the proof that this condition holds for most physical states; no free parameters or new postulated entities appear in the abstract.

axioms (1)

domain assumption Existence of a natural energy condition on bosonic states that enables logarithmic effective-dimension scaling
The paper treats this condition as the key enabler of the exponential improvement and asserts that most relevant physical states satisfy it.

pith-pipeline@v0.9.0 · 5497 in / 1485 out tokens · 47276 ms · 2026-05-10T04:37:51.040684+00:00 · methodology

discussion (0)

Forward citations

Cited by 1 Pith paper

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

Advances in quantum learning theory with bosonic systems
quant-ph 2026-05 unverdicted novelty 2.0

A concise review of sample complexities and methods for tomography and learning in continuous-variable quantum systems, with emphasis on Gaussian versus non-Gaussian states.

Reference graph

Works this paper leans on

62 extracted references · 13 canonical work pages · cited by 1 Pith paper

[1]

Plancks Gesetz und Lichtquantenhypothese,

S. N. Bose, “Plancks Gesetz und Lichtquantenhypothese,”Zeitschrift für Physik26, 178–181 (1924)

1924
[2]

London, Theλ-Phenomenon of liquid Helium and the Bose-Einstein degeneracy

F. London, “Theλ-Phenomenon of Liquid Helium and the Bose-Einstein Degeneracy,” Nature141, 643–644 (1938). https://doi.org/10.1038/141643a0

work page doi:10.1038/141643a0 1938
[3]

Measurement of subpicosecond time intervals between two photons by interference,

C. K. Hong, Z. Y. Ou, and L. Mandel, “Measurement of subpicosecond time intervals between two photons by interference,”Phys. Rev. Lett.59, 2044–2046 (1987)

2044
[4]

Encoding a qubit in an oscillator,

D. Gottesman, A. Kitaev, and J. Preskill, “Encoding a qubit in an oscillator,”Phys. Rev. A64, 012310 (2001)

2001
[5]

A scheme for efficient quantum computation with linear optics,

E. Knill, R. Laflamme, and G. Milburn, “A scheme for efficient quantum computation with linear optics,”Nature409, 46–52 (2001)

2001
[6]

Universal Quantum Computation with Continuous-Variable Cluster States,

N. C. Menicucci, P. van Loock, M. Gu, C. Weedbrook, T. C. Ralph, and M. A. Nielsen, “Universal Quantum Computation with Continuous-Variable Cluster States,” Phys. Rev. Lett.97, 110501 (2006)

2006
[7]

Quantum computational advantage with a programmable photonic processor,

L. S. Madsen, F. Laudenbach, M. F. Askarani, F. Rortais, T. Vincent, J. F. Bulmer, F. M. Miatto, L. Neuhaus, L. G. Helt, M. J. Collins,et al., “Quantum computational advantage with a programmable photonic processor,”Nature 606, 75–81 (2022)

2022
[8]

Ultra-large-scale continuous-variable cluster states multiplexed in the time domain,

S. Yokoyama, R. Ukai, S. C. Armstrong, C. Sornphiphatphong, T. Kaji, S. Suzuki, J.-i. Yoshikawa, H. Yonezawa, N. C. Menicucci, and A. Furusawa, “Ultra-large-scale continuous-variable cluster states multiplexed in the time domain,” Nature Photonics7, 982 (2013)

2013
[9]

Integrated photonic source of Gottesman–Kitaev–Preskill qubits,

M. Larsen, J. Bourassa, S. Kocsis, J. Tasker, R. Chadwick, C. González-Arciniegas, J. Hastrup, C. Lopetegui-González, F. Miatto, A. Motamedi,et al., “Integrated photonic source of Gottesman–Kitaev–Preskill qubits,”Nature 1–5 (2025)

2025
[10]

New class of quantum error-correcting codes for a bosonic mode,

M. H. Michael, M. Silveri, R. Brierley, V. V. Albert, J. Salmilehto, L. Jiang, and S. M. Girvin, “New class of quantum error-correcting codes for a bosonic mode,” Physical Review X6, 031006 (2016)

2016
[11]

Towards scalable bosonic quantum error correction,

B. M. Terhal, J. Conrad, and C. Vuillot, “Towards scalable bosonic quantum error correction,”Quantum Science and Technology 5, 043001 (2020)

2020
[12]

Encoding strongly-correlated many-boson wavefunctions on a photonic quantum computer: application to the attractive Bose-Hubbard model,

S. Yalouz, B. Senjean, F. Miatto, and V. Dunjko, “Encoding strongly-correlated many-boson wavefunctions on a photonic quantum computer: application to the attractive Bose-Hubbard model,”Quantum5, 572 (2021)

2021
[13]

Provably accurate simulation of gauge theories and bosonic systems,

Y. Tong, V. V. Albert, J. R. McClean, J. Preskill, and Y. Su, “Provably accurate simulation of gauge theories and bosonic systems,”Quantum6, 816 (2022)

2022
[14]

Hanada, S

M. Hanada, S. Matsuura, E. Mendicelli, and E. Rinaldi, “Exponential improvement in quantum simulations of bosons,” arXiv:2505.02553 [quant-ph]

work page arXiv
[15]

Positive Wigner Functions Render Classical Simulation of Quantum Computation Efficient,

A. Mari and J. Eisert, “Positive Wigner Functions Render Classical Simulation of Quantum Computation Efficient,”Physical Review Letters109, 230503 (2012)

2012
[16]

Resources for bosonic quantum computational advantage,

U. Chabaud and M. Walschaers, “Resources for bosonic quantum computational advantage,”Physical Review Letters130, 090602 (2023)

2023
[17]

Classical simulation of non-Gaussian bosonic circuits,

B. Dias and R. König, “Classical simulation of non-Gaussian bosonic circuits,”Phys. Rev. A110, 042402 (2024)

2024
[18]

Classical Simulation of Circuits with Realistic 12 Odd-Dimensional Gottesman-Kitaev-Preskill States,

C. Calcluth, O. Hahn, J. Bermejo-Vega, A. Ferraro, and G. Ferrini, “Classical Simulation of Circuits with Realistic 12 Odd-Dimensional Gottesman-Kitaev-Preskill States,”Phys. Rev. Lett.135, 010601 (2025)

2025
[19]

Upreti and U

V. Upreti and U. Chabaud, “Interplay of resources for universal continuous-variable quantum computing,”arXiv preprint arXiv:2502.07670(2025)

work page arXiv 2025
[20]

Effective descriptions of bosonic systems can be considered complete,

F. Arzani, R. I. Booth, and U. Chabaud, “Effective descriptions of bosonic systems can be considered complete,”Nature Communications16, 9744 (2025)

2025
[21]

Learning quantum states of continuous-variable systems,

F. A. Mele, A. A. Mele, L. Bittel, J. Eisert, V. Giovannetti, L. Lami, L. Leone, and S. F. Oliviero, “Learning quantum states of continuous-variable systems,”Nature Physics 1–7 (2025)

2025
[22]

Achievable rates in non- asymptotic bosonic quantum communication.arXiv preprint arXiv:2502.05524, 2025

F. A. Mele, G. Barbarino, V. Giovannetti, and M. Fanizza, “Achievable rates in non-asymptotic bosonic quantum communication,”arXiv:2502.05524 [quant-ph]

work page arXiv
[23]

On the complex zeros of the wavefunction,

S. Cerf, C. Wassner, J. Davis, F. Arzani, and U. Chabaud, “On the complex zeros of the wavefunction,”arXiv:2507.23468 [quant-ph]

work page arXiv
[24]

Quantum Computation over Continuous Variables,

S. Lloyd and S. L. Braunstein, “Quantum Computation over Continuous Variables,” Phys. Rev. Lett.82, 1784–1787 (1999)

1999
[25]

Quantum Computation and Quantum Information: 10th Anniversary Edition,

M. A. Nielsen and I. L. Chuang, “Quantum Computation and Quantum Information: 10th Anniversary Edition,”. Cambridge University Press, New York, NY, USA, 2011

2011
[26]

Quantum information with continuous variables,

S. L. Braunstein and P. van Loock, “Quantum information with continuous variables,”Rev. Mod. Phys.77, 513–577 (2005)

2005
[27]

Gaussian states in continuous variable quantum information

A. Ferraro, S. Olivares, and M. G. A. Paris, “Gaussian states in continuous variable quantum information,” arXiv:quant-ph/0503237 [quant-ph]

work page Pith review arXiv
[28]

Gaussian quantum information,

C. Weedbrook, S. Pirandola, R. García-Patrón, N. J. Cerf, T. C. Ralph, J. H. Shapiro, and S. Lloyd, “Gaussian quantum information,”Rev. Mod. Phys.84, 621–669 (2012)

2012
[29]

Coding theorem and strong converse for quantum channels,

A. Winter, “Coding theorem and strong converse for quantum channels,”IEEE Transactions on Information Theory45, 2481–2485 (1999)

1999
[30]

Learning quantum states of continuous variable systems,

F. A. Mele, A. A. Mele, L. Bittel, J. Eisert, V. Giovannetti, L. Lami, L. Leone, and S. F. E. Oliviero, “Learning quantum states of continuous variable systems,” 2024. https://arxiv.org/abs/2405.01431

work page arXiv 2024
[31]

Quantum Continuous Variables: A Primer of Theoretical Methods,

A. Serafini, “Quantum Continuous Variables: A Primer of Theoretical Methods,”. CRC Press, Taylor & Francis Group, Boca Raton, USA, 2017

2017
[32]

How to Decompose Arbitrary Continuous-Variable Quantum Operations,

S. Sefi and P. van Loock, “How to Decompose Arbitrary Continuous-Variable Quantum Operations,”Phys. Rev. Lett.107, 170501 (2011)

2011
[33]

Repeat-until-success cubic phase gate for universal continuous-variable quantum computation,

K. Marshall, R. Pooser, G. Siopsis, and C. Weedbrook, “Repeat-until-success cubic phase gate for universal continuous-variable quantum computation,”Phys. Rev. A91, 032321 (2015)

2015
[34]

Implementation of a quantum cubic gate by an adaptive non-Gaussian measurement,

K. Miyata, H. Ogawa, P. Marek, R. Filip, H. Yonezawa, J.-i. Yoshikawa, and A. Furusawa, “Implementation of a quantum cubic gate by an adaptive non-Gaussian measurement,”Phys. Rev. A93, 022301 (2016)

2016
[35]

Universal quantum computation with temporal-mode bilayer square lattices,

R. N. Alexander, S. Yokoyama, A. Furusawa, and N. C. Menicucci, “Universal quantum computation with temporal-mode bilayer square lattices,”Phys. Rev. A97, 032302 (2018)

2018
[36]

Gaussian conversion protocol for heralded generation of generalized Gottesman-Kitaev-Preskill states,

Y. Zheng, A. Ferraro, A. F. Kockum, and G. Ferrini, “Gaussian conversion protocol for heralded generation of generalized Gottesman-Kitaev-Preskill states,”Phys. Rev. A108, 012603 (2023)

2023
[37]

All-optical quantum computing using cubic phase gates,

N. Budinger, A. Furusawa, and P. van Loock, “All-optical quantum computing using cubic phase gates,”Phys. Rev. Res.6, 023332 (2024)

2024
[38]

arXiv preprint arXiv:2510.08545 , year=

U. Chabaud, S. Gharibian, S. Mehraban, A. Motamedi, H. R. Naeij, D. Rudolph, and D. Sambrani, “Energy, Bosons and Computational Complexity,” arXiv:2510.08545 [quant-ph]

work page arXiv
[39]

Unsuitability of cubic phase gates for non-Clifford operations on 13 Gottesman-Kitaev-Preskill states,

J. Hastrup, M. V. Larsen, J. S. Neergaard-Nielsen, N. C. Menicucci, and U. L. Andersen, “Unsuitability of cubic phase gates for non-Clifford operations on 13 Gottesman-Kitaev-Preskill states,”Physical Review A103, 032409 (2021)

2021
[40]

Using a Self-Kerr Nonlinearity for Magic State Preparation in Grid Codes,

J. Boudreault, R. Shillito, J.-B. Bertrand, and B. Royer, “Using a Self-Kerr Nonlinearity for Magic State Preparation in Grid Codes,” Physical Review Letters136, 120601 (2026)

2026
[41]

Quantum theory for mathematicians,

B. C. Hall, “Quantum theory for mathematicians,”, vol. 267. Springer, 2013

2013
[42]

A survey on the complexity of learning quantum states,

A. Anshu and S. Arunachalam, “A survey on the complexity of learning quantum states,” Nature Reviews Physics6, 59–69 (2024)

2024
[43]

Classical simulation of Gaussian quantum circuits with non-Gaussian input states,

U. Chabaud, G. Ferrini, F. Grosshans, and D. Markham, “Classical simulation of Gaussian quantum circuits with non-Gaussian input states,”Phys. Rev. Res. 3, 033018 (2021)

2021
[44]

Production of Schrödinger macroscopic quantum-superposition states in a Kerr medium,

K. Tara, G. S. Agarwal, and S. Chaturvedi, “Production of Schrödinger macroscopic quantum-superposition states in a Kerr medium,”Phys. Rev. A47, 5024–5029 (1993)

1993
[45]

Superposition of coherent states in Kerr medium,

W. Jin-wei and G. Guang-can, “Superposition of coherent states in Kerr medium,”Acta Physica Sinica (Overseas Edition)5, 764 (1996)

1996
[46]

Ueber die angenäherte Darstellung der Irrationalzahlen durch rationale Brüche,

A. Hurwitz, “Ueber die angenäherte Darstellung der Irrationalzahlen durch rationale Brüche,”Mathematische Annalen 39, 279–284 (1891)
[47]

Complexity of quantum tomography from genuine non-Gaussian entanglement,

X. Zhao, P. Liao, F. A. Mele, U. Chabaud, and Q. Zhuang, “Complexity of quantum tomography from genuine non-Gaussian entanglement,”Nature Communications (2025)

2025
[48]

arXiv preprint arXiv:2510.01610 , year=

J. T. Iosue, Y.-X. Wang, I. Datta, S. Ghosh, C. Oh, B. Fefferman, and A. V. Gorshkov, “Higher moment theory and learnability of bosonic states,”arXiv:2510.01610 [quant-ph]

work page arXiv
[49]

and Mele F

S. Chen, F. A. Mele, M. Fanizza, A. Li, Z. Mann, H.-Y. Huang, Y. Chen, and J. Preskill, “Towards sample-optimal learning of bosonic Gaussian quantum states,” arXiv:2603.18136 [quant-ph]

work page arXiv
[50]

Towards fault-tolerant quantum computation with universal continuous-variable gates,

S. Blair, F. Arzani, G. Ferrini, and A. Ferraro, “Towards fault-tolerant quantum computation with universal continuous-variable gates,” arXiv:2506.13643 [quant-ph]

work page arXiv
[51]

Hybrid oscillator-qubit quantum processors: Simulating fermions, bosons, and gauge fields,

E. Crane, K. C. Smith, T. Tomesh, A. Eickbusch, J. M. Martyn, S. Kühn, L. Funcke, M. A. DeMarco, I. L. Chuang, N. Wiebe, A. Schuckert, and S. M. Girvin, “Hybrid Oscillator-Qubit Quantum Processors: Simulating Fermions, Bosons, and Gauge Fields,”arXiv:2409.03747 [quant-ph]

work page arXiv
[52]

Machine learning method for state preparation and gate synthesis on photonic quantum computers,

J. M. Arrazola, T. R. Bromley, J. Izaac, C. R. Myers, K. Brádler, and N. Killoran, “Machine learning method for state preparation and gate synthesis on photonic quantum computers,”Quantum Science and Technology4, 024004 (2019)

2019
[53]

Characterization of Gaussian operations and distillation of Gaussian states,

G. Giedke and J. I. Cirac, “Characterization of Gaussian operations and distillation of Gaussian states,”Physical Review A66, 032316 (2002)

2002
[54]

Review of distributed quantum computing: From single qpu to high performance quantum computing,

D. Barral, F. J. Cardama, G. Díaz-Camacho, D. Faílde, I. F. Llovo, M. Mussa-Juane, J. Vázquez-Pérez, J. Villasuso, C. Piñeiro, N. Costas,et al., “Review of distributed quantum computing: From single qpu to high performance quantum computing,”Computer Science Review57, 100747 (2025)

2025
[55]

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

N. Guseynov, Z. Holmes, and A. Angrisani, “Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems,” arXiv:2604.xxxxx [quant-ph]
[56]

Properties of squeezed number states and squeezed thermal states,

M. S. Kim, F. A. M. de Oliveira, and P. L. Knight, “Properties of squeezed number states and squeezed thermal states,”Phys. Rev. A40, 2494–2503 (1989)

1989
[57]

Wright,How to learn a quantum state

J. Wright,How to learn a quantum state. PhD thesis, Carnegie Mellon University, 2016

2016
[58]

Riemannian optimization of photonic quantum circuits in phase and Fock space,

Y. Yao, F. Miatto, and N. Quesada, “Riemannian optimization of photonic quantum circuits in phase and Fock space,” SciPost Phys.17, 082 (2024)

2024
[59]

A faster hafnian formula for complex matrices and its benchmarking on a supercomputer,

A. Björklund, B. Gupt, and N. Quesada, “A faster hafnian formula for complex matrices and its benchmarking on a supercomputer,” arXiv:1805.12498 [cs.DS]

work page arXiv
[60]

On the complexity of calculating factorials,

P. B. Borwein, “On the complexity of calculating factorials,”Journal of Algorithms 6, 376–380 (1985). 14

1985
[61]

Experimental realization of any discrete unitary operator,

M. Reck, A. Zeilinger, H. J. Bernstein, and P. Bertani, “Experimental realization of any discrete unitary operator,”Phys. Rev. Lett. 73, 58–61 (1994). 15 Supplementary Material A Additional Notations For the proofs given in this Supplementary Material, we use the following notations for the hyperbolic trigonometric functions for brevity: sr := sinh(r);c r...

1994
[62]

= ∑ m=n |am|4 + ∑ m̸=n |am|2|an|2 cos(ϵ(n2 1−m2 1)) = ∑ |m|,|n|≤k |am|2|an|2 + ∑ m̸=n |am|2|an|2(cos(ϵ(n2 1−m2 1))−1). (180) Therefore, we get |⟨ψred|ϕred⟩|2 = 1 + ∑ m̸=n|am|2|an|2(cos(ϵ(n2 1−m2 1))−1) ∑ |m|,|n|≤k|am|2|an|2 (181) For pure states, the trace distance betweenψred andϕred is given by d(ψred,ϕred)2 = 1−|⟨ψred|ϕred⟩|2 = ∑ m̸=n|am|2|an|2(1−cos(ϵ...