Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

What Determines an Amplitude Format's Error: Closed-Form Predictors for Quantum State-Vector Storage

Christopher K Merrill

Published Sep 9, 2026• 0 citations
Publisher

Abstract

Two published simulators store quantum amplitudes in two bytes rather than sixteen, and a third layout, block floating point, is what current machine-learning hardware executes natively. A companion paper measured all three against a rate-distortion floor and asked which is best. This paper asks what each one's error is a function of, and answers it in closed form. We first show that the error of Betelú's polar-logarithmic format is a constant of the format. His Eq. 10 is derived for maximally entangled random states, but its hypothesis is only that the fractional parts of the scaled log-modulus and phase are equidistributed; where they are, the amplitude distribution cancels out of the sum. Across 280 snapshots spanning a random circuit from two starting states at 18, 20 and 22 qubits, the measured error departs from that constant by at most 2.06%, 0.95% and 0.27%, the residual falling as 1/sqrt(N) while the other formats move by 29 bits. Regressed on the log-variance of the moduli, on the entanglement entropy, and on both, its R^2 is 0.000. That is the extreme case of a general result: every format here has an error that is a closed-form functional of the state, computable without running the conversion. We give seven such predictors, none fitted, with a median measured-to-derived ratio of 1.000 where each applies, and we name the three ways the underlying model fails, each with a test evaluable in advance. A correction to our own earlier model follows from one of them. We then use the seven to answer the question the companion paper could not pose. There is no crossover between block floating point and either competitor along circuit depth or amplitude spread. Randomly permuting a state's amplitudes preserves its histogram and destroys block locality, and doing so multiplies block floating point's losses to polar-log from 8 in 451 states to 60 in 451. How much of its advantage is structural depends on the state: none of it on random states, where permuting changes nothing, and up to a factor of 3.6 at moderate spread. It also shows that permutation invariance follows from having one parameter per state rather than from being per-amplitude, so a global scale has it. Finally, we record that the single state property we preregistered as the predictor is the right answer for none of the seven formats, and that after a single conversion the total variation distance cannot see phase error at all. All results are at 18 to 22 qubits on a single core. Every number is produced by a released script from released data.

DOI
10.5281/zenodo.22678277

Related papers

How Few Bits Per Amplitude? A Rate–Distortion Floor for Quantum State-Vector Formats, and Where Per-Block Scaling Wins

Christopher K Merrill

Full state-vector simulation of quantum circuits is limited by the memory and bandwidth needed to hold 2^n complex amplitudes. Two published simulators store amplitudes in two bytes rather than sixteen: JUQCS-A (De Raedt et al., 2019), which uses a global linear magnitude grid with an eight-bit phase, and the polar-logarithmic format of Betelú (2020). Betelú closes by asking whether any format uses less storage for a given error. We answer that question. We first establish an information-theoretic floor. The amplitudes of a maximally entangled random state are independent complex Gaussians, so the Shannon rate-distortion bound applies and no format can achieve squared error below 2^-B at B bits per amplitude. Measured against it, JUQCS-A sits 2.17 bits above the floor and Betelú's format 4.21 bits. Block floating point with a shared power-of-two exponent per 32 amplitudes — the MXINT8 layout that current machine-learning hardware executes natively — sits 2.24 bits above it, and 1.20 bits with an exact scale. Block floating point beats JUQCS-A by 1.95x at an exact scale, sits within 17% of it at a power-of-two scale with the ordering set by qubit parity, and beats it on every concentrated state we tested on both metrics. Against Betelú it splits along a boundary we locate and explain. It wins on random states by 3.90x in squared error, a margin that grows as ln N because a global scale is set by an extreme value of the sample. It loses above three or four spikes spread across distinct blocks — the output shape of Shor's algorithm — and it loses the quantum Fourier transform by 2.16x, where Betelú's phase field renders most controlled rotations exact. But the choice of metric decides the winner: across every concentrated state we tested, total variation distance between measurement distributions reverses each squared-error loss, because a block scale flattens amplitudes carrying O(1/N) of the norm that no measurement resolves. All results are at 16-24 qubits on a single core. Every number is produced by a released script. v2 — 2026-09-04 No results or numbers changed from v1. Figure 1: legend moved clear of the curves it was overlapping, and the "Betelú" label in both figure legends corrected — a LaTeX escape had been rendering literally as Betel\'u. Section 4: replaced "per-block scaling recovers most of the remaining gap" with the measured fractions (71% with an exact scale, 47% with a power-of-two scale), which the following paragraph contradicted. Source archive now includes LICENSE and CORRECTIONS.md, so the deposit carries the license it names and the corrections record its README points at.

•Sep 5, 2026•0 citations

Exact Entanglement Entropy and Code Distance for Stabilizer States, Computed Without Floating-Point Arithmetic

Joel Cruz Cabrera

Standard quantum circuit simulation represents amplitudes as double-precision complex numbers, so quantities such as entanglement entropy are computed only approximately. We revisit two well-known facts about the stabilizer formalism — that entanglement entropy of a stabilizer state is always an integer, and that the distance of a stabilizer code is a combinatorial quantity — and implement both exactly, using binary linear algebra over F2 on the stabilizer tableau, with no floating-point step anywhere in the computation. We verify the entropy formula against Qiskit's floating-point von Neumann entropy on canonical states and on 30 random Clifford circuits (all matches exact), reproduce the area-law entanglement of the 1D cluster state, and verify the code-distance procedure against three canonical quantum error-correcting codes (Steane, the 5-qubit code, and Shor's code), recovering their published distances exactly. As an illustration of the exact toolkit in use, we report an empirical scaling law for the depth at which entanglement saturates in a specific random-circuit model. Finally, since every result above concerns exact mathematics or exact simulation of noiseless Clifford circuits, we complement it with a small, honestly-labelled real-hardware comparison: the GHZ state on 3–7 qubits, run on IBM Quantum superconducting hardware, measured against the exact noiseless prediction our formalism computes, together with a quantitative check against a naive noise model built from the device's own published calibration data — which the data systematically contradicts by 18–21 percentage points, a discrepancy we report along with our best physical explanation for it. A second, independent hardware experiment measures the cluster state's own stabilizer generators directly, and identifies a single miscalibrated physical qubit as correlated with elevated error; a follow-up control experiment, forcing the circuit onto verified low-error qubits instead, confirms the effect is causal but partial (leakage drops by 1.84 percentage points, roughly a third of the excess) rather than the whole explanation, which we report at its true, unexaggerated size. Applying the naive noise model to the control circuit itself reverses its bias (now optimistic rather than pessimistic) by an amount consistent, to order of magnitude, with ordinary decoherence over the circuit's execution time — a physical effect the naive model was never built to capture.

•Jul 27, 2026•0 citations

Quantum Error Detection and Correction

Yorick Hardy, Willi-Hans Steeb

The algorithms discussed in Chapter 21 rely on having isolated systems to store information. In practical applications this is not possible, and the environment interacts with the systems causing decoherence. Suppose the data is contained in the state |x〉, and the environment is described by |E〉. The initial state of the entire system is described by the tensor product of the states |X〉⊗|E〉, which evolves according to some unitary operation U. The state |x〉 evolves according to the unitary operation U x which describes the algorithm. In classical error correction codes, all that needs to be corrected are bit flips (see Chapter 10). In the quantum case errors such as bit flips, phase changes and rotations complicate the error correction techniques. Since arbitrary errors in an encoding of information cannot be corrected, only certain types of errors are assumed to occur (this was also the case in classical error correction, where an upper bound in the number of bits that could be flipped in a transmission was assumed). The types of errors depend on the implementation. For example, suppose the types of errors (which we assume are distinguishable due to an encoding) are described by the unitary basis E 1,...E n , so that all errors are a linear combination [138] E = al.E 1 + ... + a n E n ,...E † E = I.

Birkhäuser Basel eBooks•Jan 1, 2001•0 citations

Operational Identifiability of Tensor Product Structures: Exact Rigidity Laws, a Two-Operation Threshold, and an Aliasing Limit

Ryan Cardwell, Claude

Here's what this paper means for actual humans: WHAT THIS IS ABOUT. When you build or use a quantum device, everything rests on knowing what its parts are: which degrees of freedom are "qubit 1," which are "qubit 2." The companion paper ("Forged Frames") showed that simple mathematical criteria cannot certify this; convincing fakes exist. This paper answers the question that result leaves standing: what is the MINIMUM experimental information that genuinely pins down a system's subsystem structure, and when can that information silently fail? WHAT WE FOUND, IN PLAIN TERMS. Four things. (1) EXACT LAWS INSTEAD OF MEASUREMENTS. Any wrong choice of parts must visibly distort the family of unentangled states, and we derive exactly how much, at every system size: closed-form constants (verified to seven decimal places), an explicit error bound, and a surprise. The two natural ways to measure "wrongness" (state distortion versus operator scrambling) turn out to be literally the same measurement, up to a fixed number, whenever the two parts have equal size. Wrongness cannot hide. (2) THE TWO-OPERATION THRESHOLD. You can pin down what your subsystems are by implementing just TWO generic operations and checking their statistics, while a THOUSAND mutually commuting operations tell you nothing at all. Diversity of control, not volume of control, is what fixes what your qubits are. The residual uncertainty is proportional to your measurement tolerance, with a constant we derive exactly and show how to compute in advance, so an experimenter can screen candidate operation pairs and pick a strong one (random pairs are typically several times worse, occasionally catastrophically so). (3) THE ALIASING LIMIT: CERTIFICATION CAN PASS WHILE TELLING YOU NOTHING. If you sample your certification data at special "resonant" times (set by the operations' energy scales), a maximally wrong assignment of subsystems passes the test perfectly. What your qubits are depends on when you looked. We characterize these blind spots exactly (for qubits they are universal and computable in advance; the danger windows shrink with the square root of your tolerance), and the fix costs almost nothing: sample at two different times, at least one away from the resonant set. With that, certification is restored; we prove it exactly and measure it. (4) REAL-LAB BUDGETS. We work out what certification costs in actual measurement shots (the error falls off unusually fast, inversely with the total number of shots rather than with its square root), how hardware noise floors the procedure, and how a simple reference measurement removes that floor to first order. A single seven-row table in the paper is effectively a lab protocol: it shows, condition by condition, which kinds of experimental access identify the subsystem structure (two generic operations: yes; one operation, commuting operations, resonant sampling: no). WHY IT MATTERS. For quantum hardware: this is a concrete recipe for certifying that the qubits you think you have are the qubits you physically have, with explicit tolerances, a sampling-time warning that is a real failure mode on calibrated hardware, and shot budgets. For foundations: the contested question "does physics determine its own subsystems?" gets a quantitative operational answer. Physics determines an operational subsystem CLASS (not one preferred coordinate representation of it), and that class is fixed by two operations sampled at two times, and by nothing less that we tested. WHAT IT OPENS UP. The seven-row identifiability table is a blueprint for a tabletop experiment on any small quantum platform; running it on hardware would move this from simulation to laboratory fact. On the theory side the paper leaves sharply posed open problems: the exact global constants when the two parts differ in size, the number-theoretic structure of long-time sampling (the failure times form a small-divisor hierarchy), and the extension from two parts to many. METHODS NOTE, BECAUSE IT MATTERS FOR TRUST. Every quantitative claim was pre-registered in the companion scripts before its run. The full ledger, including predictions that failed and one published-in-note constant that our own later theory overturned, is an appendix of the paper. All code, data, and working notes are in the deposit, seeded for exact reproduction. WHO AND HOW. A human-AI collaboration: research direction and standards of evidence by Ryan Cardwell (Crystalline Labs); design, code, derivations, and drafting by Claude (Anthropic), including autonomous sessions under the program's pre-registration rules, with adversarial reviews by other AI models incorporated and credited.

•Aug 15, 2026•7 citations

A divergence norm for the fourth-order coefficient and the invariance of the counting law

Moustafa A. Radwan

The fourth-order coefficient that controls the relative-entropy disturbance of a reduced quantum state under Gaussian coherent noise is identified here as one half of the quadratic form of the chi-squared divergence, evaluated not on a state but on the second-order mean drift of that state. The coefficient had appeared in an existing series of papers as a computed number attached to each noise family separately, with no statement of what kind of object it is. Naming it as a divergence norm on the drift is what makes the three results below possible, and each of them is a statement the series could not have reached while the coefficient remained a number. The first result is an identification, not a new computation. Five symbols are used for that coefficient across the series, carrying three different normalisations; they are shown to denote one quantity, and the conversion between them is recorded in a table. The normalisation that each symbol carries is stated explicitly, because the three differ by factors of the monitored dimension and of the total dimension, and a reader comparing two of the papers without that table would conclude that they disagree. The second result is a deformation. When the generating function of the expansion is replaced by the one-parameter family whose member at unit parameter is the logarithm, the coefficient becomes the quadratic form of the corresponding divergence of that family. The reason is local and explicit: the confluent value of the deformed kernel is the second derivative of the generator, so the kernel that the expansion produces is the Hessian of the generating function and nothing else. Closed forms follow for both noise families already studied, expressed in the power sums of the deformed theory. For unitarily invariant noise the coefficient is a single quadratic combination of three power sums. For Pauli-string noise on a stabilizer code only one power sum moves. The third result follows from the second. Because the only dependence on the deformation parameter sits in the diagonal of the kernel, whose sum over the spectrum is that single power sum, the counting law for stabilizer codes is invariant in form under the entire deformation, with the power sum read at the working parameter. The law is therefore not a feature of the relative entropy in particular; it is a feature of the whole family, and the choice of generating function changes one scalar in it and nothing of its structure. A structural correction to the series is also recorded, and it is the result with the clearest consequence for error correction. Protection at fourth order requires two independent conditions: the vanishing of every first-order amplitude, and the vanishing of the drift. The Knill-Laflamme condition supplies only the first. A code satisfying it may therefore carry a fourth-order error, and the residual is exactly the coefficient above together with the connected channel. That residual is thus the obstruction to full protection at this order, and a protection statement elsewhere in the series, which asserts the two conditions to be equivalent, is strictly weaker than it claims. A code and a noise family exhibiting the gap are given, and the residual is measured on them. The manuscript is self-contained. Three appendices derive, from the definitions, every ingredient that the results use: the two expansion coefficients and the quadratic form through the divided-difference Frechet derivative, the drift of each noise family from the completeness identities of the mode algebra, and the two vanishing arguments. No statement in the paper depends on work that is not yet published, and one appendix reproduces, from a convention-free law for the drift, the published coefficient of an earlier paper of the series, including the factor that the geometry of four tensor factors contributes to it. Every identity is certified numerically against the integral definitions of the deformed theory rather than against the closed forms used to derive it: the power sums are computed by quadrature in the substitution t = exp(u), with the interval split at the logarithm of every eigenvalue, at ninety working digits, and only then compared. Every statement of the appendices is checked separately on explicit matrices built from the definitions, with the perturbation applied by exact matrix exponentiation. Each check reports the discrepancy it attains rather than a verdict, so that the resolution of the test is visible; where a finite difference sets that resolution, the tolerance of the row is the resolution attained and not a wish. Three rational values reported as exactly verified in an earlier paper of the series are reproduced here from a single spectrum by a route not used when they were obtained. The archive deposited with this record carries the four self-contained checks, a README describing what each one measures, and the licence. Four further guards belong to the manuscript and are not in the archive, because none of them can run without files that are not part of it; they check the documents and the deposit rather than the mathematics, and all four are named in the README. The limitations of the work are stated in the manuscript as six paragraphs, among them the restriction of the drift to the diagonal case, the factor outside the weight hypothesis, and the extent of the prior-art search behind the disclaimer of novelty, which was two queries and the reading of two abstracts: the verdict recorded for the new statements is therefore "not found", which is weaker than "new". The use of an AI tool in the research and in the preparation of the manuscript is disclosed in the Acknowledgements, with the model and its version named, and described in the section on numerical certification.

•Nov 2, 2026•0 citations

Quantum error correction and detection: Quantitative analysis of a coherent-state amplitude-damping code

Ricardo Wickert, Peter van Loock

We reexamine a non-Gaussian quantum error-correction code designed to protect optical coherent-state qubits against errors due to an amplitude-damping channel. We improve on a previous result [R. Wickert, N. K. Bernardes, and P. van Loock, Phys. Rev. A 81, 062344 (2010)] by providing a tighter upper bound on the performance attained when considering realistic assumptions, which constrain the operation of the gates employed in the scheme. The quantitative characterization is performed through measures of fidelity and concurrence, the latter obtained by employing the code as an entanglement distillation protocol. We find that, when running the code in fully deterministic error-correction mode, direct transmission can only be beaten for certain combinations of channel and input state parameters. In contrast, in error-detection mode, the usage of higher repetition encodings remains beneficial throughout, however, at the expense of diminishing success probabilities.

arXiv:1303.0273•Physical Review A•May 9, 2014•9 citations
Two published simulators store quantum amplitudes in two bytes rather than sixteen, and a third layout, block floating point, is what current machine-learning hardware executes natively. A companion paper measured all three against a rate-distortion floor and asked which is best. This paper asks what each one's error is a function of, and answers it in closed form. We first show that the error of Betelú's polar-logarithmic format is a constant of the format. His Eq. 10 is derived for maximally entangled random states, but its hypothesis is only that the fractional parts of the scaled log-modulus and phase are equidistributed; where they are, the amplitude distribution cancels out of the sum. Across 280 snapshots spanning a random circuit from two starting states at 18, 20 and 22 qubits, the measured error departs from that constant by at most 2.06%, 0.95% and 0.27%, the residual falling as 1/sqrt(N) while the other formats move by 29 bits. Regressed on the log-variance of the moduli, on the entanglement entropy, and on both, its R^2 is 0.000. That is the extreme case of a general result: every format here has an error that is a closed-form functional of the state, computable without running the conversion. We give seven such predictors, none fitted, with a median measured-to-derived ratio of 1.000 where each applies, and we name the three ways the underlying model fails, each with a test evaluable in advance. A correction to our own earlier model follows from one of them. We then use the seven to answer the question the companion paper could not pose. There is no crossover between block floating point and either competitor along circuit depth or amplitude spread. Randomly permuting a state's amplitudes preserves its histogram and destroys block locality, and doing so multiplies block floating point's losses to polar-log from 8 in 451 states to 60 in 451. How much of its advantage is structural depends on the state: none of it on random states, where permuting changes nothing, and up to a factor of 3.6 at moderate spread. It also shows that permutation invariance follows from having one parameter per state rather than from being per-amplitude, so a global scale has it. Finally, we record that the single state property we preregistered as the predictor is the right answer for none of the seven formats, and that after a single conversion the total variation distance cannot see phase error at all. All results are at 18 to 22 qubits on a single core. Every number is produced by a released script from released data.
Full state-vector simulation of quantum circuits is limited by the memory and bandwidth needed to hold 2^n complex amplitudes. Two published simulators store amplitudes in two bytes rather than sixteen: JUQCS-A (De Raedt et al., 2019), which uses a global linear magnitude grid with an eight-bit phase, and the polar-logarithmic format of Betelú (2020). Betelú closes by asking whether any format uses less storage for a given error. We answer that question. We first establish an information-theoretic floor. The amplitudes of a maximally entangled random state are independent complex Gaussians, so the Shannon rate-distortion bound applies and no format can achieve squared error below 2^-B at B bits per amplitude. Measured against it, JUQCS-A sits 2.17 bits above the floor and Betelú's format 4.21 bits. Block floating point with a shared power-of-two exponent per 32 amplitudes — the MXINT8 layout that current machine-learning hardware executes natively — sits 2.24 bits above it, and 1.20 bits with an exact scale. Block floating point beats JUQCS-A by 1.95x at an exact scale, sits within 17% of it at a power-of-two scale with the ordering set by qubit parity, and beats it on every concentrated state we tested on both metrics. Against Betelú it splits along a boundary we locate and explain. It wins on random states by 3.90x in squared error, a margin that grows as ln N because a global scale is set by an extreme value of the sample. It loses above three or four spikes spread across distinct blocks — the output shape of Shor's algorithm — and it loses the quantum Fourier transform by 2.16x, where Betelú's phase field renders most controlled rotations exact. But the choice of metric decides the winner: across every concentrated state we tested, total variation distance between measurement distributions reverses each squared-error loss, because a block scale flattens amplitudes carrying O(1/N) of the norm that no measurement resolves. All results are at 16-24 qubits on a single core. Every number is produced by a released script. v2 — 2026-09-04 No results or numbers changed from v1. Figure 1: legend moved clear of the curves it was overlapping, and the "Betelú" label in both figure legends corrected — a LaTeX escape had been rendering literally as Betel\'u. Section 4: replaced "per-block scaling recovers most of the remaining gap" with the measured fractions (71% with an exact scale, 47% with a power-of-two scale), which the following paragraph contradicted. Source archive now includes LICENSE and CORRECTIONS.md, so the deposit carries the license it names and the corrections record its README points at.
Standard quantum circuit simulation represents amplitudes as double-precision complex numbers, so quantities such as entanglement entropy are computed only approximately. We revisit two well-known facts about the stabilizer formalism — that entanglement entropy of a stabilizer state is always an integer, and that the distance of a stabilizer code is a combinatorial quantity — and implement both exactly, using binary linear algebra over F2 on the stabilizer tableau, with no floating-point step anywhere in the computation. We verify the entropy formula against Qiskit's floating-point von Neumann entropy on canonical states and on 30 random Clifford circuits (all matches exact), reproduce the area-law entanglement of the 1D cluster state, and verify the code-distance procedure against three canonical quantum error-correcting codes (Steane, the 5-qubit code, and Shor's code), recovering their published distances exactly. As an illustration of the exact toolkit in use, we report an empirical scaling law for the depth at which entanglement saturates in a specific random-circuit model. Finally, since every result above concerns exact mathematics or exact simulation of noiseless Clifford circuits, we complement it with a small, honestly-labelled real-hardware comparison: the GHZ state on 3–7 qubits, run on IBM Quantum superconducting hardware, measured against the exact noiseless prediction our formalism computes, together with a quantitative check against a naive noise model built from the device's own published calibration data — which the data systematically contradicts by 18–21 percentage points, a discrepancy we report along with our best physical explanation for it. A second, independent hardware experiment measures the cluster state's own stabilizer generators directly, and identifies a single miscalibrated physical qubit as correlated with elevated error; a follow-up control experiment, forcing the circuit onto verified low-error qubits instead, confirms the effect is causal but partial (leakage drops by 1.84 percentage points, roughly a third of the excess) rather than the whole explanation, which we report at its true, unexaggerated size. Applying the naive noise model to the control circuit itself reverses its bias (now optimistic rather than pessimistic) by an amount consistent, to order of magnitude, with ordinary decoherence over the circuit's execution time — a physical effect the naive model was never built to capture.
The algorithms discussed in Chapter 21 rely on having isolated systems to store information. In practical applications this is not possible, and the environment interacts with the systems causing decoherence. Suppose the data is contained in the state |x〉, and the environment is described by |E〉. The initial state of the entire system is described by the tensor product of the states |X〉⊗|E〉, which evolves according to some unitary operation U. The state |x〉 evolves according to the unitary operation U x which describes the algorithm. In classical error correction codes, all that needs to be corrected are bit flips (see Chapter 10). In the quantum case errors such as bit flips, phase changes and rotations complicate the error correction techniques. Since arbitrary errors in an encoding of information cannot be corrected, only certain types of errors are assumed to occur (this was also the case in classical error correction, where an upper bound in the number of bits that could be flipped in a transmission was assumed). The types of errors depend on the implementation. For example, suppose the types of errors (which we assume are distinguishable due to an encoding) are described by the unitary basis E 1,...E n , so that all errors are a linear combination [138] E = al.E 1 + ... + a n E n ,...E † E = I.
Here's what this paper means for actual humans: WHAT THIS IS ABOUT. When you build or use a quantum device, everything rests on knowing what its parts are: which degrees of freedom are "qubit 1," which are "qubit 2." The companion paper ("Forged Frames") showed that simple mathematical criteria cannot certify this; convincing fakes exist. This paper answers the question that result leaves standing: what is the MINIMUM experimental information that genuinely pins down a system's subsystem structure, and when can that information silently fail? WHAT WE FOUND, IN PLAIN TERMS. Four things. (1) EXACT LAWS INSTEAD OF MEASUREMENTS. Any wrong choice of parts must visibly distort the family of unentangled states, and we derive exactly how much, at every system size: closed-form constants (verified to seven decimal places), an explicit error bound, and a surprise. The two natural ways to measure "wrongness" (state distortion versus operator scrambling) turn out to be literally the same measurement, up to a fixed number, whenever the two parts have equal size. Wrongness cannot hide. (2) THE TWO-OPERATION THRESHOLD. You can pin down what your subsystems are by implementing just TWO generic operations and checking their statistics, while a THOUSAND mutually commuting operations tell you nothing at all. Diversity of control, not volume of control, is what fixes what your qubits are. The residual uncertainty is proportional to your measurement tolerance, with a constant we derive exactly and show how to compute in advance, so an experimenter can screen candidate operation pairs and pick a strong one (random pairs are typically several times worse, occasionally catastrophically so). (3) THE ALIASING LIMIT: CERTIFICATION CAN PASS WHILE TELLING YOU NOTHING. If you sample your certification data at special "resonant" times (set by the operations' energy scales), a maximally wrong assignment of subsystems passes the test perfectly. What your qubits are depends on when you looked. We characterize these blind spots exactly (for qubits they are universal and computable in advance; the danger windows shrink with the square root of your tolerance), and the fix costs almost nothing: sample at two different times, at least one away from the resonant set. With that, certification is restored; we prove it exactly and measure it. (4) REAL-LAB BUDGETS. We work out what certification costs in actual measurement shots (the error falls off unusually fast, inversely with the total number of shots rather than with its square root), how hardware noise floors the procedure, and how a simple reference measurement removes that floor to first order. A single seven-row table in the paper is effectively a lab protocol: it shows, condition by condition, which kinds of experimental access identify the subsystem structure (two generic operations: yes; one operation, commuting operations, resonant sampling: no). WHY IT MATTERS. For quantum hardware: this is a concrete recipe for certifying that the qubits you think you have are the qubits you physically have, with explicit tolerances, a sampling-time warning that is a real failure mode on calibrated hardware, and shot budgets. For foundations: the contested question "does physics determine its own subsystems?" gets a quantitative operational answer. Physics determines an operational subsystem CLASS (not one preferred coordinate representation of it), and that class is fixed by two operations sampled at two times, and by nothing less that we tested. WHAT IT OPENS UP. The seven-row identifiability table is a blueprint for a tabletop experiment on any small quantum platform; running it on hardware would move this from simulation to laboratory fact. On the theory side the paper leaves sharply posed open problems: the exact global constants when the two parts differ in size, the number-theoretic structure of long-time sampling (the failure times form a small-divisor hierarchy), and the extension from two parts to many. METHODS NOTE, BECAUSE IT MATTERS FOR TRUST. Every quantitative claim was pre-registered in the companion scripts before its run. The full ledger, including predictions that failed and one published-in-note constant that our own later theory overturned, is an appendix of the paper. All code, data, and working notes are in the deposit, seeded for exact reproduction. WHO AND HOW. A human-AI collaboration: research direction and standards of evidence by Ryan Cardwell (Crystalline Labs); design, code, derivations, and drafting by Claude (Anthropic), including autonomous sessions under the program's pre-registration rules, with adversarial reviews by other AI models incorporated and credited.
The fourth-order coefficient that controls the relative-entropy disturbance of a reduced quantum state under Gaussian coherent noise is identified here as one half of the quadratic form of the chi-squared divergence, evaluated not on a state but on the second-order mean drift of that state. The coefficient had appeared in an existing series of papers as a computed number attached to each noise family separately, with no statement of what kind of object it is. Naming it as a divergence norm on the drift is what makes the three results below possible, and each of them is a statement the series could not have reached while the coefficient remained a number. The first result is an identification, not a new computation. Five symbols are used for that coefficient across the series, carrying three different normalisations; they are shown to denote one quantity, and the conversion between them is recorded in a table. The normalisation that each symbol carries is stated explicitly, because the three differ by factors of the monitored dimension and of the total dimension, and a reader comparing two of the papers without that table would conclude that they disagree. The second result is a deformation. When the generating function of the expansion is replaced by the one-parameter family whose member at unit parameter is the logarithm, the coefficient becomes the quadratic form of the corresponding divergence of that family. The reason is local and explicit: the confluent value of the deformed kernel is the second derivative of the generator, so the kernel that the expansion produces is the Hessian of the generating function and nothing else. Closed forms follow for both noise families already studied, expressed in the power sums of the deformed theory. For unitarily invariant noise the coefficient is a single quadratic combination of three power sums. For Pauli-string noise on a stabilizer code only one power sum moves. The third result follows from the second. Because the only dependence on the deformation parameter sits in the diagonal of the kernel, whose sum over the spectrum is that single power sum, the counting law for stabilizer codes is invariant in form under the entire deformation, with the power sum read at the working parameter. The law is therefore not a feature of the relative entropy in particular; it is a feature of the whole family, and the choice of generating function changes one scalar in it and nothing of its structure. A structural correction to the series is also recorded, and it is the result with the clearest consequence for error correction. Protection at fourth order requires two independent conditions: the vanishing of every first-order amplitude, and the vanishing of the drift. The Knill-Laflamme condition supplies only the first. A code satisfying it may therefore carry a fourth-order error, and the residual is exactly the coefficient above together with the connected channel. That residual is thus the obstruction to full protection at this order, and a protection statement elsewhere in the series, which asserts the two conditions to be equivalent, is strictly weaker than it claims. A code and a noise family exhibiting the gap are given, and the residual is measured on them. The manuscript is self-contained. Three appendices derive, from the definitions, every ingredient that the results use: the two expansion coefficients and the quadratic form through the divided-difference Frechet derivative, the drift of each noise family from the completeness identities of the mode algebra, and the two vanishing arguments. No statement in the paper depends on work that is not yet published, and one appendix reproduces, from a convention-free law for the drift, the published coefficient of an earlier paper of the series, including the factor that the geometry of four tensor factors contributes to it. Every identity is certified numerically against the integral definitions of the deformed theory rather than against the closed forms used to derive it: the power sums are computed by quadrature in the substitution t = exp(u), with the interval split at the logarithm of every eigenvalue, at ninety working digits, and only then compared. Every statement of the appendices is checked separately on explicit matrices built from the definitions, with the perturbation applied by exact matrix exponentiation. Each check reports the discrepancy it attains rather than a verdict, so that the resolution of the test is visible; where a finite difference sets that resolution, the tolerance of the row is the resolution attained and not a wish. Three rational values reported as exactly verified in an earlier paper of the series are reproduced here from a single spectrum by a route not used when they were obtained. The archive deposited with this record carries the four self-contained checks, a README describing what each one measures, and the licence. Four further guards belong to the manuscript and are not in the archive, because none of them can run without files that are not part of it; they check the documents and the deposit rather than the mathematics, and all four are named in the README. The limitations of the work are stated in the manuscript as six paragraphs, among them the restriction of the drift to the diagonal case, the factor outside the weight hypothesis, and the extent of the prior-art search behind the disclaimer of novelty, which was two queries and the reading of two abstracts: the verdict recorded for the new statements is therefore "not found", which is weaker than "new". The use of an AI tool in the research and in the preparation of the manuscript is disclosed in the Acknowledgements, with the model and its version named, and described in the section on numerical certification.
We reexamine a non-Gaussian quantum error-correction code designed to protect optical coherent-state qubits against errors due to an amplitude-damping channel. We improve on a previous result [R. Wickert, N. K. Bernardes, and P. van Loock, Phys. Rev. A 81, 062344 (2010)] by providing a tighter upper bound on the performance attained when considering realistic assumptions, which constrain the operation of the gates employed in the scheme. The quantitative characterization is performed through measures of fidelity and concurrence, the latter obtained by employing the code as an entanglement distillation protocol. We find that, when running the code in fully deterministic error-correction mode, direct transmission can only be beaten for certain combinations of channel and input state parameters. In contrast, in error-detection mode, the usage of higher repetition encodings remains beneficial throughout, however, at the expense of diminishing success probabilities.