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.
Classical Simula- tion of Quantum Supremacy Circuits
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
verdicts
UNVERDICTED 7roles
background 2polarities
background 2representative citing papers
Clifft introduces a factored-state simulator that shifts exponential cost to a dynamic active subspace, generalizing Stim's compile-once model to near-Clifford circuits and enabling the first exact end-to-end simulations of magic-state cultivation over hundreds of billions of shots.
A classical polynomial-time sampler exists for the output distribution of amplitude-damped IQP circuits with logarithmic depth and arbitrary l-local diagonal gates.
For unitaries from local or pairwise interactions, depolarizing noise above a critical strength makes open quantum spin chain dynamics exactly classically simulable by halting growth in the negative Markov chain representation.
Spectral bounds relate graph Laplacian eigenvalues to the congestion of binary-tree embeddings, with an efficient spectral-ordering algorithm and applications to tensor-network contraction complexity.
Local refinement after cotengra yields a bond-dimension-dependent cost advantage on Sycamore topologies that is absent on random or QAOA graphs.
SparQSim is a sparse-state quantum simulator in C++ supporting QRAM that outperforms dense Schrödinger simulators on high-sparsity benchmark circuits and produces consistent results for quantum linear system solvers.
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.
-
Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits
Clifft introduces a factored-state simulator that shifts exponential cost to a dynamic active subspace, generalizing Stim's compile-once model to near-Clifford circuits and enabling the first exact end-to-end simulations of magic-state cultivation over hundreds of billions of shots.
-
Efficient simulation of noisy IQP circuits with amplitude-damping noise
A classical polynomial-time sampler exists for the output distribution of amplitude-damped IQP circuits with logarithmic depth and arbitrary l-local diagonal gates.
-
Quantum-to-Classical Computability Transition via Negative Markov Chains
For unitaries from local or pairwise interactions, depolarizing noise above a critical strength makes open quantum spin chain dynamics exactly classically simulable by halting growth in the negative Markov chain representation.
-
Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
Spectral bounds relate graph Laplacian eigenvalues to the congestion of binary-tree embeddings, with an efficient spectral-ordering algorithm and applications to tensor-network contraction complexity.
-
Bond-dimension scaling of a local-refinement advantage over hyperoptimized tensor-network contraction on Sycamore like topologies
Local refinement after cotengra yields a bond-dimension-dependent cost advantage on Sycamore topologies that is absent on random or QAOA graphs.
-
SparQSim: Simulating Scalable Quantum Algorithms via Sparse Quantum State Representations
SparQSim is a sparse-state quantum simulator in C++ supporting QRAM that outperforms dense Schrödinger simulators on high-sparsity benchmark circuits and produces consistent results for quantum linear system solvers.