paper / mundada / Apr 15
A polynomial-based simulation enables efficient strong simulation and gradient-based optimization of photonic circuits for heralded ballistic graph state generators. Two-pass procedure first maximizes fidelity and success probability via unitary transformation, then sparsifies into minimal beamsplitter circuits with rational coefficients. For 4-qubit states, success probabilities reach 7.813e-3 (4.7x fusion baseline); for 5-qubit, up to 1.157e-3 (7.5x improvement), including first circuits for certain 5-qubit classes.
quantum-computingphotonic-circuitsgraph-statesfusion-based-quantumcircuit-optimizationquantum-simulation
“Optimized 4-qubit graph state circuits achieve success probabilities from 2.053×10^{-3} to 7.813×10^{-3}”
paper / mundada / Apr 15
A heterogeneous quantum architecture integrates task-specific hardware, quantum processing units, memories, and specialized accelerators with a full microarchitecture and compiler for 1,000 logical qubits. It achieves up to 138x reduction in physical qubit overhead and 551x lower logical error versus monolithic baselines across algorithms. For RSA-2048 factorization on grid-coupled hardware, it requires 381k qubits and 9.2 days, improvable to 4.9 days with an adder accelerator (439k qubits) or 190k qubits under 10 days with qLDPC memory and long-range coupling.
heterogeneous-architecturequantum-error-correctionfault-tolerant-quantumqubit-requirementsquantum-compilerrsa-factorizationqec-codes
“Heterogeneous architecture reduces physical qubit overhead by up to 138x compared to monolithic baseline.”