🔬

Quantum Computing

7
Open Unknowns
12
Cross-Domain Bridges
10
Active Hypotheses

Cross-Domain Bridges

Bridge Google's Sycamore quantum processor (2019) demonstrated quantum computational advantage by sampling a random quantum circuit distribution in 200s vs estimated 10,000 classical years, framing the question of quantum advantage as the complexity separation BQP vs BPP and connecting quantum entanglement physics to computational complexity theory.

Fields: Computer Science, Physics, Quantum Computing, Computational Complexity, Quantum Information

Google's 53-qubit Sycamore processor (Arute et al. 2019) sampled the output distribution of a pseudo-random quantum circuit in 200s, with classical simulation estimated at 10,000 years on Summit super...

Bridge Topological quantum error-correcting codes (Kitaev's toric code) are physically realized as Z2 lattice gauge theories whose ground states are topological phases of matter — bridging quantum information theory, condensed-matter physics, and high-energy gauge theory via the shared language of anyons, topological order, and ground-state degeneracy on non-trivial manifolds.

Fields: Quantum Information, Condensed Matter Physics, Topological Field Theory, Quantum Computing

Kitaev's toric code (2003) is simultaneously: (A) A quantum error-correcting code with macroscopic code distance, where logical qubits are encoded in global topological degrees of freedom immune t...

Bridge Topological insulators host bulk band gaps alongside surface/edge states protected by time-reversal symmetry, characterized by the ℤ₂ topological invariant and Chern number C = (1/2π)∫_{BZ} Ω_k dk — a quantized topological invariant that predicts the quantum anomalous Hall conductance σ_xy = Ce²/h without free parameters.

Fields: Physics, Materials Science, Condensed Matter Physics, Mathematics, Quantum Computing

Topological insulators (TIs) are materials whose electronic band structure has a bulk gap (like a conventional insulator) but whose surface or edge hosts gapless, conducting states protected by time-r...

Bridge Quantum approximate optimization algorithms bridge discrete combinatorial optimization with classical surrogate warm-start and benchmarking workflows.

Fields: Quantum Computing, Computer Science, Operations Research

Established baseline literature maps QAOA-style parameterized quantum circuits onto classical optimization landscapes; related speculative analogy (deployment-dependent): classical surrogate models tr...

Bridge Quantum key distribution achieves information-theoretic security (unconditional security independent of adversary computing power) by exploiting quantum measurement disturbance, bridging quantum computing and cryptography through the quantum no-cloning theorem and Shannon's one-time pad.

Fields: Quantum Computing, Cryptography, Information Theory

BB84 quantum key distribution achieves information-theoretic security (proven secure against computationally unbounded adversaries) because any eavesdropping measurement on quantum states introduces d...

Bridge The quantum fault-tolerance threshold theorem connects quantum error correction to information theory: if the physical error rate per gate p is below a threshold p_th (typically ~1% for surface codes), arbitrarily long quantum computations can be performed reliably by concatenating error-correcting codes, with overhead growing only polylogarithmically in computation length.

Fields: Quantum Computing, Quantum Information Theory, Computer Science

For a concatenated code of level k with physical error rate p and threshold p_th, the logical error rate scales as p_L = p_th·(p/p_th)^{2^k}. Each level of concatenation doubles the exponent, so after...

Bridge Quantum stabilizer codes are the quantum analog of classical linear codes — the threshold theorem proves that fault-tolerant quantum computation is achievable when physical error rates fall below approximately 1%.

Fields: Quantum Computing, Quantum Error Correction, Classical Coding Theory, Computer Science

Quantum error correction (Shor 1995, Steane 1996) maps directly onto classical coding theory: a [[n, k, d]] quantum code encodes k logical qubits into n physical qubits with code distance d (able to c...

Bridge Continuous-time quantum walks on graphs underpin spatial-search constructions where marked vertices couple as potential shifts — embedding Grover-type quadratic speedups into Laplacian spectral geometry while preserving caveats about optimality on arbitrary graphs versus structured Johnson/hypercube families.

Fields: Quantum Computing, Quantum Information, Computer Science, Spectral Graph Theory

Childs & Goldstone showed spatial search via continuous-time quantum walk locates a marked vertex on several graph families in O(√N) time by tuning a Hamiltonian built from the graph Laplacian plus a ...

Bridge Quantum annealing replaces thermal fluctuations with quantum tunneling: the transverse-field Ising model H=-Γ(t)Σσᵢˣ - J·Σσᵢᶻσⱼᶻ maps optimization onto adiabatic quantum evolution, generalizing simulated annealing

Fields: Quantum Computing, Combinatorics, Statistical Physics

Simulated annealing (SA) solves combinatorial optimization by sampling from the Boltzmann distribution P(s) ∝ exp(-E(s)/T), decreasing T to concentrate probability on the minimum. Quantum annealing (Q...

Bridge Quantum walks generalize classical random walks by allowing quantum superposition of paths, achieving quadratically faster spreading (sigma ~ t vs t^1/2) and providing the computational primitive for quantum speedup in graph algorithms.

Fields: Quantum Computing, Probability Theory, Algorithm Theory

The discrete-time quantum walk on a line replaces the classical coin flip (probability distribution P(x,t) satisfying the diffusion equation) with a unitary coin operator C acting on a qubit; the resu...

Bridge Topological quantum computing encodes qubits in non-Abelian anyons — quasiparticle excitations of topological phases whose braiding operations implement quantum gates by exchanging particle worldlines, with error correction guaranteed topologically because qubit states are stored in the globally degenerate ground state subspace inaccessible to local perturbations

Fields: Quantum Computing, Topology, Condensed Matter

Non-Abelian anyons (e.g., Fibonacci anyons, Majorana zero modes) in 2D topological phases have a braid group representation where exchanging anyons i and j applies a unitary gate U(σ_ij) on the degene...

Bridge Topological insulators are materials with insulating bulk but conducting surface states protected by time-reversal symmetry — classified by topological invariants (Z₂, Chern number) from algebraic topology applied to electronic band theory, with applications to fault-tolerant quantum computing via Majorana edge modes.

Fields: Quantum Physics, Condensed Matter Physics, Materials Science, Algebraic Topology, Quantum Computing

Topological insulators (TIs) are a phase of matter where the bulk band structure has a non-trivial topological invariant, even though the material is an insulator in the bulk. The topological invarian...

Open Unknowns (7)

Unknown Which graph families encountered in hardware layouts preserve continuous-time quantum walk spatial-search speedups under realistic connectivity constraints, decoherence, and oracle compilation overhead relative to discrete Grover circuits? u-ctqw-grover-geometry-transferability
Unknown Have non-Abelian anyons been experimentally realized with sufficient fidelity to demonstrate braiding-based topological quantum gates, and what material systems provide the best platform for scalable topological qubits resistant to local decoherence? u-non-abelian-anyons-topological-qc
Unknown Does quantum annealing provide a provable computational advantage over classical simulated annealing for any practically relevant optimization problem class, and on what problem instances? u-quantum-annealing-simulated
Unknown What is the precise boundary between optimization problems where quantum annealing offers speedup over classical simulated annealing? u-quantum-speedup-optimization-boundary
Unknown What is the precise noise threshold below which classical simulation of random quantum circuits becomes exponentially hard, and does Google's supremacy claim survive improved classical simulation algorithms? u-quantum-supremacy-hardness-noise-boundary
Unknown At what decoherence rate does the quadratic quantum walk speedup over classical random walks disappear, and can noise-tolerant quantum walk algorithms recover polynomial speedup on near-term hardware? u-quantum-walk-decoherence-practical-speedup
Unknown Can the spectral gap of a local Hamiltonian be computed efficiently, and does its vanishing exactly predict quantum phase transition locations? u-spectral-gap-quantum-phase-transitions

Active Hypotheses

Hypothesis Chern-Simons gauge theory at level k provides the mathematical framework for topological quantum computation via anyons in the fractional quantum Hall state at filling fraction nu = 1/(2k+1), and the non-Abelian case (nu = 5/2) supports universal quantum gates through braiding operations that are exponentially protected from local decoherence. high
Hypothesis Tanner graph spectral gap is a stronger predictor of LDPC code threshold performance under belief propagation than variable or check node degree distributions alone, and codes constructed from Ramanujan graphs achieve belief propagation thresholds within 0.1 dB of the Shannon limit. high
Hypothesis The Feigenbaum universality of period-doubling routes to chaos (δ ≈ 4.669, α ≈ 2.502) extends to quantum maps via the quantum-classical correspondence: quantized versions of the logistic map and the Hénon map exhibit the same universal period-doubling ratios in the semiclassical limit (ℏ → 0, N_eff → ∞), with quantum corrections suppressed as O(ℏ) relative to classical universal behavior. medium
Hypothesis For noisy CTQW spatial-search simulations on hardware-motivated irregular graphs, empirical hitting-time plateaus correlate with normalized Laplacian spectral gaps extracted from the connectivity adjacency — falsified if gap estimates explain less than 40% of variance across randomized disorder draws at fixed N. medium
Hypothesis CRYSTALS-Kyber's current parameter sets (Kyber-512, Kyber-768, Kyber-1024) provide quantum security margins of approximately 108, 178, and 240 bits respectively against the best known quantum lattice sieving algorithms — sufficient for the 128/192/256-bit classical security targets — but these estimates may decrease by 10-30 bits as quantum algorithms mature in the next decade. high
Hypothesis NIST-standardized lattice-based post-quantum cryptographic algorithms (CRYSTALS-Kyber, CRYSTALS-Dilithium) will be deployed in > 50% of new TLS connections by 2028 and provide adequate security against harvest-now- decrypt-later attacks if migration begins by 2025, but systems with > 10-year confidentiality requirements are already at significant risk from data harvested before migration. critical
Hypothesis Majorana zero modes in semiconductor-superconductor nanowire devices provide topological protection that extends qubit coherence time by at least one order of magnitude compared to conventional superconducting qubits operating at the same temperature, provided the topological gap exceeds 100 μeV and the system length exceeds 5 coherence lengths critical
Hypothesis Neutral atom qubit gate fidelities are primarily limited by motional-state decoherence during Rydberg blockade gates, and active motional-state cooling (sideband cooling to ground state) combined with magic wavelength optical tweezers will enable two-qubit gate fidelities ≥99.9% sufficient for fault-tolerant threshold. high
Hypothesis Fusion-based linear optical quantum computing (FBQC, Bartolucci et al. 2023) can achieve fault-tolerant quantum computation with photon loss rates < 10% by replacing two-qubit gates with probabilistic Bell-state measurements and encoding logical qubits in resource states, making photonic QC scalable without deterministic photon-photon interactions. high
Hypothesis Classical surrogates fitted on low-depth QAOA telemetry reduce median time-to-target energy when transferred as warm starts under matched noise calibration. high

Know something about Quantum Computing? Contribute an unknown or hypothesis →

Generated 2026-05-10 · USDR Dashboard