The biplanar architecture maps Fermi-Hubbard spin sectors to two planes, eliminating swaps and cutting each Trotter step depth to 4t_synth + 90 logical timesteps versus 6t_synth + 354 in single-plane methods, yielding an estimated 2-hour runtime for L=8 with 1.35 million physical qubits under a 1% 1
Photonic fusion of entangled resource states from a quantum emitter,
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
Authors propose a low-optical-depth fusion-based photonic quantum computing architecture using quantum-dot emitters, adaptive repeat-until-success fusions, and time-bin qubits, with resource estimates and error-threshold simulations for fault tolerance.
New building block and protocol for all-photonic quantum repeaters using repeater graph states that reduces emissive memories at end nodes and integrates with memory-based systems.
citing papers explorer
-
Two Layers, No Swaps: Biplanar SPOQC Architecture Improves Runtime of Fermi-Hubbard Simulation
The biplanar architecture maps Fermi-Hubbard spin sectors to two planes, eliminating swaps and cutting each Trotter step depth to 4t_synth + 90 logical timesteps versus 6t_synth + 354 in single-plane methods, yielding an estimated 2-hour runtime for L=8 with 1.35 million physical qubits under a 1% 1
-
Practical blueprint for low-depth photonic quantum computing with quantum dots
Authors propose a low-optical-depth fusion-based photonic quantum computing architecture using quantum-dot emitters, adaptive repeat-until-success fusions, and time-bin qubits, with resource estimates and error-threshold simulations for fault tolerance.
-
Architecture and protocols for all-photonic quantum repeaters
New building block and protocol for all-photonic quantum repeaters using repeater graph states that reduces emissive memories at end nodes and integrates with memory-based systems.