A hot-zone architecture for OQFT on reconfigurable neutral-atom hardware yields tunable latency via 2-4 zones, converging to roughly 500 extra logical ancillae and 128-qubit peak parallelism for half-time performance on 256-2048 bit instances.
Jones, Low-overhead constructions for the fault-tolerant toffoli gate, Physical Review A 87, 10.1103/physreva.87.022328 (2013)
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 2
method 1
citation-polarity summary
fields
quant-ph 5representative citing papers
Reordering database addresses before ESOP minimization produces smaller QROM circuits for Grover oracles, with simulated annealing yielding roughly 30% size reduction over fixed ordering for small N.
Resource estimates show Shor's algorithm can break 256-bit ECDLP with fewer than 1450 logical qubits and 90 million Toffoli gates on fast-clock quantum hardware, enabling on-spend attacks on cryptocurrency mempools.
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.
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.
citing papers explorer
-
Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study
A hot-zone architecture for OQFT on reconfigurable neutral-atom hardware yields tunable latency via 2-4 zones, converging to roughly 500 extra logical ancillae and 128-qubit peak parallelism for half-time performance on 256-2048 bit instances.
-
Database Reordering for Compact Grover Oracles with ESOP Minimization
Reordering database addresses before ESOP minimization produces smaller QROM circuits for Grover oracles, with simulated annealing yielding roughly 30% size reduction over fixed ordering for small N.
-
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.
-
Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.