OIST & Keio researchers achieve linear O(n) scaling for graph state preparation using a split-fuse construction and QASST, enabling hundreds-of-qubit states for measurement-based QC and quantum networking — down from O(n²) gate complexity.
#QuantumNetworking #GraphStates #News
Proves that the 27-qubit LU-LC conjecture counterexample is minimal: for all graph states on ≤26 qubits, LU-equivalence equals LC-equivalence. Result leverages 2-local complementation formalism and connections to triorthogonal codes.
#QuantumInformation #GraphStates #Research
New QASST-based split-fuse method achieves linear scaling in CZ gates, circuit depth & auxiliary qubits for distance-hereditary graph state prep—outperforming brute-force LC orbit search for large-scale MBQC and quantum networking.
#GraphStates #QuantumNetworking #MBQC
Circle graph states satisfy LU=LC equivalence and bipartite variants correspond bijectively to planar code states. Despite polynomial rank-width, MBQC on circle graph states is efficiently classically simulable. Counting LU-equivalent graph states is #P-hard.
#GraphStates #QuantumComputing #MBQC
Lara presented her poster on spin-photon entanglement for the generation of multiphotonic graph states 🧵🧠 Exciting progress toward scalable photonic quantum computing!
#QuantuMatter2025#QuantumComputing #SpinPhotonEntanglement #GraphStates #QuantumDots #Photonics #C2N #Quandela
Helio shared new results on deterministic and reconfigurable graph state generation with a solid-state quantum emitter 💡🔗 Exciting step toward scalable photonic quantum computing! Published in Nat. Comm. 16, 4337 (2025)!
#QuantuMatter2025 #QuantumComputing #GraphStates #QuantumDot #C2N
