Coherent-state propagation enables quasi-polynomial classical simulation of bosonic circuits with logarithmically many Kerr gates at exponentially small trace-distance error, with polynomial runtime in the weak-nonlinearity regime.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
Random projections enable a tunable tradeoff between coherent quantum resources and sampling overhead for multi-copy estimation of multivariate traces like tr(ρ^K).
The work proves a worst-case sample complexity of O(sqrt(4.5^n)) for distributed inner product estimation with local Clifford sampling on n-qubit states, with a conjectured O(sqrt(3.6^n)) for Haar sampling.
citing papers explorer
-
Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
Coherent-state propagation enables quasi-polynomial classical simulation of bosonic circuits with logarithmically many Kerr gates at exponentially small trace-distance error, with polynomial runtime in the weak-nonlinearity regime.
-
Random Projections for Multi-Copy Quantum Algorithms
Random projections enable a tunable tradeoff between coherent quantum resources and sampling overhead for multi-copy estimation of multivariate traces like tr(ρ^K).
-
Worst-Case Sample Complexity Bounds for Distributed Inner Product Estimation with Local Randomized Measurements
The work proves a worst-case sample complexity of O(sqrt(4.5^n)) for distributed inner product estimation with local Clifford sampling on n-qubit states, with a conjectured O(sqrt(3.6^n)) for Haar sampling.