Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.
Logical entanglement distribution between distant 2d array qubits
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2verdicts
UNVERDICTED 2representative citing papers
Entanglement boosting protocol prepares logical Bell pairs in rotated surface codes with orders-of-magnitude lower link-limited volume, reaching 10^{-10} logical error from 86 physical pairs at 1% error using soft decoders and postselection within one patch.
citing papers explorer
-
Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice
Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.
-
Entanglement boosting: Low-volume logical Bell pair preparation for distributed fault-tolerant quantum computation
Entanglement boosting protocol prepares logical Bell pairs in rotated surface codes with orders-of-magnitude lower link-limited volume, reaching 10^{-10} logical error from 86 physical pairs at 1% error using soft decoders and postselection within one patch.