A two-pass optimization framework with polynomial-based simulation discovers heralded ballistic circuits for 3-5 qubit graph states achieving up to 7.5x higher success probabilities than fusion baselines, including first known circuits for some 5-qubit states.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2025 2verdicts
UNVERDICTED 2representative citing papers
A new algorithm converts low-entanglement bosonic Gaussian states to matrix product states in polynomial time without hafnian calculations, yielding speedups on experimental boson sampling data.
citing papers explorer
-
Automated discovery of heralded ballistic graph state generators for fusion-based photonic quantum computation
A two-pass optimization framework with polynomial-based simulation discovers heralded ballistic circuits for 3-5 qubit graph states achieving up to 7.5x higher success probabilities than fusion baselines, including first known circuits for some 5-qubit states.
-
Efficient simulation of low-entanglement bosonic Gaussian states in polynomial time
A new algorithm converts low-entanglement bosonic Gaussian states to matrix product states in polynomial time without hafnian calculations, yielding speedups on experimental boson sampling data.