#

quantum-computing

(6 articles)

"The Classical Ghost"

The Quantum Approximate Optimization Algorithm was supposed to demonstrate quantum advantage on hard combinatorial problems. Morone, Kent, and Sels strip QAOA down to its skeleton — the iterative rotation structure — and rebuild it with classical kicked tops. The result: the classical version outperforms the quantum version on the canonical Sherrington-Kirkpatrick spin-glass benchmark at every circuit depth tested. The mechanism is instructive. QAOA works not because of quantum superposition or entanglement, but because of its rotation protocol — iteratively kicking a system toward better configurations. When you replace quantum spins with classical kicked tops, the rotation structure survives and the quantum noise disappears. Quantum fluctuations, it turns out, generate higher-rank noise in the system's covariance matrix, which hampers precise control. The classical version has cleaner dynamics. This doesn't mean quantum computing is useless. It means the source of QAOA's power was misidentified. The algorithm works because of its variational structure, not because of its quantum substrate. The quantumness is not a feature — it's overhead. Removing it makes the algorithm faster. The practical implication is immediate: the classical version, called VIRAL, can be implemented on nanometer-scale magnetic tunnel junctions using magnetic fields and spin torques. No cryogenic cooling, no decoherence management, no quantum error correction. A chip that fits on a fingertip doing the same optimization that a quantum computer does in a dilution refrigerator. The deeper question: how many other quantum algorithms carry classical ghosts — algorithms whose real mechanism is geometric or dynamical, with quantum mechanics adding noise rather than power? If you can't identify what specifically requires quantum mechanics, you might be paying for overhead you don't need.

quantum-computingoptimizationclassical-mechanicsspin-glasskicked-topsQAOA

The Classical Braid

# The Classical Braid Non-Abelian anyons are the theoretical foundation of topological quantum computing. Exchange two anyons, and the system's state changes — not just by a phase (as with fermions or bosons), but by a matrix transformation that depends on the order of exchanges. Braid them in sequence A-B-C and the result differs from C-B-A. The computation is encoded in the topology of the braid, which protects it from local perturbation. The promise is fault tolerance built into physics rather than layered on top. The assumption has always been that this requires quantum mechanics. The non-Abelian statistics arise from quantum states in topological phases of matter — fractional quantum Hall systems, topological superconductors. The exchange algebra is a property of quantum ground states with topological degeneracy. Tóth and colleagues show that topological defects in nematic liquid crystals — entirely classical objects — exhibit the same non-Abelian exchange statistics (arXiv:2604.00492). Four defects in a nematic pattern are braided by physically moving them around each other. The defect profiles transform according to non-Abelian rules, described by bivectors on a Bloch-like hemisphere. The algebra is the same. The substrate is a room-temperature classical fluid. The defects are geometric spinors — objects that require a 720-degree rotation to return to their original state, just like quantum spin-1/2 particles. This spinorial character is not quantum. It is topological — a consequence of how the director field wraps around each defect. When two such defects exchange positions, the global field configuration transforms by a matrix, not a scalar. That is the definition of non-Abelian statistics. The through-claim: non-Abelian braiding is a mathematical fact about topological defects in ordered media, not a physical fact about quantum mechanics. Quantum systems happen to host such defects, but the algebra lives in the topology, and topology does not ask whether the medium is quantum or classical.

liquid-crystalstopologynon-Abelian-anyonsMajoranabraidingquantum-computingclassical-analogy

"The Simpler Explanation"

# The Simpler Explanation Signals in nanoscale superconducting devices were published as evidence of topological quantum states — the kind of states that could enable error-resistant quantum computing. The signals appeared in leading journals. The claims were celebrated. A replication effort led by Sergey Frolov at the University of Pittsburgh reproduced the experiments and analyzed more complete datasets. The striking signals that appeared to confirm major breakthroughs could be explained in simpler ways. Alternative interpretations — ordinary physical effects, measurement artifacts, selective data presentation — accounted for the observations without requiring topological physics. The replication paper took two years of peer and editorial review before publication in *Science*. Multiple journals rejected it for "lack of novelty" — a structural irony, since demonstrating that a celebrated result has a mundane explanation is, by definition, not novel. It is anti-novel. The system is built to reward new claims, not to check existing ones. The structural lesson is not about fraud. There is no suggestion that the original researchers fabricated data. The issue is that incomplete analysis can produce apparent breakthroughs. A subset of the data, presented at the right resolution, with the right framing, generates a signal that looks topological. The fuller dataset reveals that the signal exists in a space of explanations, and the simplest one is not the exciting one. This failure mode is general to any field where measurements are noisy and theories are rich enough to interpret noise as signal. The breakthrough was not manufactured. It was selected — by the natural tendency to analyze data until it says something interesting, and to stop analyzing when it does.

quantum-computingreplicationmethodologytopological-materialsscientific-integritydata-sharing

The Smoking Gun Problem

# The Smoking Gun Problem Topological quantum computing promises error-resistant qubits. The idea is that certain quantum states, protected by topology, resist the environmental noise that destroys information in conventional quantum systems. Demonstrating these states experimentally would be a breakthrough — the first step toward hardware that doesn't need external error correction. For over a decade, papers in top journals reported signals consistent with topological effects in nanoscale superconducting and semiconducting devices. Each paper identified a specific experimental marker — a distinctive signature in conductance, a quantized plateau, an anomalous zero-bias peak — and argued that the marker was the smoking gun for the claimed topological state. Frolov and collaborators at Pittsburgh, Minnesota, and Grenoble spent years replicating these experiments (Science, January 2026). In every case, they found that the dramatic signals could be explained by simpler, non-topological mechanisms. The smoking guns were real data — the signals existed — but the interpretation was wrong. More complete exploration of the parameter space revealed that the same signatures appeared under conditions where topological effects were impossible. The signals were not diagnostic. They were coincidental. The publication path reveals the structural problem. The original breakthrough papers appeared in leading journals. The replication studies — showing the breakthroughs were not what they seemed — were rejected by those same journals. The replication paper underwent two years of peer review before Science published it. The institutions that amplified the claims resisted the corrections. This is not corruption. It is the predictable outcome of a system that rewards discoveries and penalizes retractions. The "smoking gun" framing is the mechanism. When a field identifies a single dramatic experimental marker as the decisive test, researchers optimize for producing that marker. Comprehensive parameter sweeps are expensive and unglamorous. Targeted experiments that hit the expected signature are cheap and publishable. The search for the smoking gun selects for experiments that find it, even when the gun belongs to someone else. The four cases Frolov examined share a structure: each original study reported a striking signal, argued it could only arise from topological physics, and published a limited dataset that supported the interpretation. Each replication found that broader exploration — more parameter combinations, more device configurations, more complete datasets — dissolved the uniqueness claim. The signal wasn't unique to the claimed mechanism. It just looked unique when you only looked where the mechanism predicted you should. The structural lesson is about the epistemology of dramatic evidence. A smoking gun is not evidence that the suspect committed the crime. It is evidence that a gun was fired. Establishing who fired it requires additional information that the dramatic signal itself does not contain. In physics, a quantized plateau is not evidence of a topological state. It is evidence of quantization. Establishing the topological origin requires ruling out every non-topological mechanism that produces quantization — a task that requires exhaustive parameter exploration, not a single dramatic measurement. The journals that published the originals and rejected the replications were making a judgment about interestingness, not about truth. Breakthroughs are interesting. Replications are not. But the information content of a replication failure is higher than the information content of the original claim — it constrains the interpretation space that the original left open. The correction is more informative than the claim, and harder to publish. The asymmetry is structural.

replicationquantum-computingtopological-physicsscientific-methodpeer-reviewevidence

The Hyperbolic Code

# The Hyperbolic Code Fault-tolerant quantum computing with cluster states requires lattice structures that support error correction. Standard constructions use Euclidean lattices — square, cubic, or related periodic tilings of flat space. Hyperbolic lattices — tilings of negatively curved space — seem geometrically worse: they grow exponentially, have irregular boundary effects, and resist the periodic structure that makes Euclidean codes tractable. Hyperbolic cluster states achieve comparable fault-tolerance thresholds while supporting constant encoding rates and substantially reduced qubit overhead. The negative curvature that makes the geometry unwieldy for classical purposes becomes a resource for quantum error correction. The advantage comes from the exponential growth of hyperbolic tilings. In Euclidean lattices, the number of physical qubits grows polynomially with the code distance, giving a polynomial overhead for fault tolerance. In hyperbolic lattices, the exponential growth means that the ratio of logical to physical qubits can be held constant — the encoding rate does not vanish as the code distance increases. This constant rate is impossible in Euclidean constructions, where the encoding rate necessarily decreases with increasing code distance. The fault-tolerance threshold — the physical error rate below which logical errors can be suppressed arbitrarily — remains comparable to Euclidean values. The hyperbolic construction does not sacrifice error correction quality for encoding efficiency. The structural observation: geometric curvature that is a liability for spatial intuition is an asset for information density. The exponential growth that makes hyperbolic spaces hard to visualize is exactly what provides constant encoding rates. The code uses the curvature, not despite it.

quantum-computingerror-correctionhyperbolic-geometrycluster-statesfault-tolerancemeasurement-based

The Cheap Phase

# The Cheap Phase Quantum phase estimation extracts eigenvalue information from unitary operators. Standard algorithms require controlled unitaries — gates where a control qubit determines whether the unitary acts on the target register. These controlled operations are expensive: each controlled unitary requires roughly twice the two-qubit gate count of the uncontrolled version, and m-bit estimation needs m such controlled operations. The replacement: use uncontrolled unitaries and move the control structure to the input state. Instead of controlling whether the operation happens, prepare the input in a controlled superposition that achieves the same information extraction. The cost of controlled state preparation is exponentially cheaper than controlled unitary application for typical cases. The gate count reduction is exponential in the number of precision bits. For m-bit phase estimation, the standard approach uses O(m) controlled unitaries, each with gate cost proportional to the unitary itself. The new approach uses O(m) uncontrolled unitaries plus O(m) controlled state preparations, where the state preparations are single-qubit operations. The two-qubit gate count drops by a factor that grows exponentially with m. The structural observation: control can be applied at different points in a quantum circuit, and the cost of control depends on where it is applied. Controlling a complex operation is expensive; controlling a simple state preparation is cheap. The information extracted is the same — the control structure is relocated, not removed. The circuit computes the same function through a different factorization of the same logical operation.

quantum-computingphase-estimationcircuit-complexityquantum-algorithmsgate-reduction