Vine codes generalize directional codes to open planar boundaries, delivering up to 28% fewer data/measure qubits at circuit distance 7 and better simulated performance than the surface code at 10^{-3} noise while using fewer total qubits.
Title resolution pending
8 Pith papers cite this work, alongside 1 external citations. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
fields
quant-ph 8representative citing papers
A new heuristic compiler for multi-qubit iceberg patches reduces circuit depth by 34 percent, cuts gate counts, and improves fidelity metrics on 71 benchmarks compared with naive mapping.
Generalizes phase kickback checks for √T magic state cultivation in doubled color code, reports simulation consistency with S state performance, and outlines lattice surgery escape strategy.
Experimental realization of lattice surgery on two d=3 surface-code logical qubits in superconducting hardware, with logical Bell state, Deutsch-Jozsa algorithm, and conditioned non-Clifford gate fidelity of 0.943.
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
Implicit ZNE parameter choices flip significance in ~12% of tested configurations and hardware drift changes apparent effect size up to 3.4×, so QEM benchmarks need stricter statistical reporting.
A multi-atom Rydberg gate with N ancillae enables N-fold photon collection for fast neutral-atom measurement, achieving infidelity below 10^{-3} in 6 μs with N=5 in Cs-Rb simulations.
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.
citing papers explorer
-
Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid
Vine codes generalize directional codes to open planar boundaries, delivering up to 28% fewer data/measure qubits at circuit distance 7 and better simulated performance than the surface code at 10^{-3} noise while using fewer total qubits.
-
Logical Compilation for Multi-Qubit Iceberg Patches
A new heuristic compiler for multi-qubit iceberg patches reduces circuit depth by 34 percent, cuts gate counts, and improves fidelity metrics on 71 benchmarks compared with naive mapping.
-
Efficient Magic State Cultivation for $\sqrt{T}$ Gates
Generalizes phase kickback checks for √T magic state cultivation in doubled color code, reports simulation consistency with S state performance, and outlines lattice surgery escape strategy.
-
A superconducting surface-code processor with lattice-surgery logical operations
Experimental realization of lattice surgery on two d=3 surface-code logical qubits in superconducting hardware, with logical Bell state, Deutsch-Jozsa algorithm, and conditioned non-Clifford gate fidelity of 0.943.
-
Magic state cultivation: growing T states as cheap as CNOT gates
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
-
Claim against Measurement: Statistical Artefacts in Quantum Error Mitigation Benchmarks
Implicit ZNE parameter choices flip significance in ~12% of tested configurations and hardware drift changes apparent effect size up to 3.4×, so QEM benchmarks need stricter statistical reporting.
-
Fast measurement of neutral atoms with a multi-atom gate
A multi-atom Rydberg gate with N ancillae enables N-fold photon collection for fast neutral-atom measurement, achieving infidelity below 10^{-3} in 6 μs with N=5 in Cs-Rb simulations.
-
Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations
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.