Skip to content

About

Quantum memory costs for delayed local X/Z measurements: exact finite-size tradeoffs, one-qubit memory allocation, and a collective advantage for unequal accuracies, with proofs and reproducible certificates.

Topics

Resources

Stars

0 stars

Watchers

0 watching

Forks

Repository files navigation

Quantum Interface Cost

How much must remain quantum when the measurement is chosen later?

An encoder receives one unknown quantum register. It must store the register before learning which local X or Z measurement will be requested. Classical records are free; only the quantum memory is limited.

The central question is when retaining original qubits is optimal, and when a collective encoding helps. The supplied results give exact common-accuracy costs through four inputs, a complete allocation rule for one memory qubit at every input size, and a collective advantage for a specified unequal-accuracy task.

Purpose and contact

This repository serves as a record of the work and a guide for the author’s self-directed learning. For discussion or potential collaboration, please contact Ruge Lin at gogoko699@gmail.com.

Start with one review

The teaching anchor is Gühne, Haapasalo, Kraft, Pellonpää and Uola, Incompatible measurements in quantum information science, Reviews of Modern Physics 95, 011003 (2023). The learning path selects the relevant sections and connects them to this project. It is the only external tutorial required by the path; the additional arguments are explained here.

Read the repository in three passes

Pass Route Purpose
The question This page, then the learning path and first tutorial Understand the memory task and work the two-input example
The proof Memory to proofs, then the core argument Connect an arbitrary encoder to the exact memory bounds
The evidence Scientific scope, prior comparison and evidence freeze Check assumptions, attribution and proof evidence

A first example: two inputs, one memory qubit

With only classical memory, a single qubit can support later noisy X and Z measurements with contrasts $x,z$ precisely when $x^2+z^2\le1$. Equal contrasts therefore stop at $1/\sqrt2$.

For two inputs, keep one qubit chosen by a fair coin and measure the other with the compatible X/Z measurement. Record the choice and the measurement outcome. Each site is retained half the time, so all four possible queries have contrast

$$\begin{aligned} \eta&=\frac{1+1/\sqrt2}{2}\approx0.8536,\\\ \varepsilon&=\frac{1-\eta}{2}\approx0.0732. \end{aligned}$$

Here $\varepsilon$ is the worst-case binary total-variation error, over all input states. The one-qubit theorem proves that an arbitrary collective encoder cannot improve this common accuracy.

Classical X/Z contrasts form a quarter disk. The midpoint between its equal-contrast boundary and perfect retention gives the per-site accuracy when two inputs share one memory qubit.

Reading the figure. A is the compatible classical boundary; B is perfect retention. Their midpoint C is the contrast at each site when exactly one of two input qubits is retained, chosen with equal probability.

The worked tutorial derives the disk, constructs this protocol and then treats unequal accuracies.

The operational model

When What happens
Before the query An arbitrary collective encoder acts on one unknown $n$-qubit state, which may be entangled across its sites
What survives A quantum register of dimension at most $2^q$ in every branch, plus an unrestricted finite classical record
After the query A site $i$ and either $X_i$ or $Z_i$ are specified; a decoder using the memory and record returns one binary outcome

The guarantee holds for every input and each allowed query. The quantum cap is branchwise, not an average. All branches are accepted; there are no extra copies, source reaccess, preshared entanglement or free quantum bypass. The decoder may depend on the query. Its task is to reproduce the requested measurement statistics, not to reconstruct the whole input state.

Main results and their boundaries

Exact finite common accuracy

Retaining a random subset of $q$ sites and measuring the rest gives the unrestricted optimum for $1\le n\le4$ and integer $q=0,\ldots,n$:

$$\boxed{\eta_{\max}(n,q) =\frac qn+\left(1-\frac qn\right)\frac1{\sqrt2}.}$$

The converse covers arbitrary collective encoders, spectra and binary decoders. These are all 14 integer-qubit budgets through four inputs. The same formula holds for $q=1$ at every $n$.

Complete one-qubit allocation

For arbitrary local contrasts $(x_i,z_i)\in[0,1]^2$, the exact region with one memory qubit is

$$\boxed{\sum_i w(x_i,z_i)\le1,}$$

where

$$w(x,z)=\left[x+z-1-\sqrt{2(1-x)(1-z)}\right]_+.$$

Here $[a]_+=\max(a,0)$. The tutorial explains $w$ as a required retention fraction. The converse applies established CHSH monogamy; every feasible profile has a random original-site-retention implementation.

A collective advantage for unequal accuracies

A complete encoder for 31 inputs using five memory qubits has

$$x_i=1,\qquad z_i=\frac1{\sqrt{31}}\quad\text{at every site}.$$

It exceeds the defined original-site-retention class, including joint measurements of discarded sites. This is a class separation, not a claim of unrestricted optimality or improved common accuracy.

The balanced-spectrum theorem and stability are optional structural companions. The general common-accuracy optimum, sharp entropy bound and asymptotic rate remain open. The smallest remaining finite common-accuracy case is $(n,q)=(5,2)$.

Proofs, sources and evidence

The core argument connects the selected proofs. The focused source map distinguishes established frameworks and ingredients from the supplied evaluations. The manuscript background guide connects the required concepts to those sources and the selected results; its BibTeX bibliography is ready for citation reuse. Proof reconstructions are internal; no external peer-review or exhaustive publication-priority certification is claimed.

The scientific evidence freeze pins the reviewed proof inputs, checker sources and historical reports. The release check records the subsequent reproduction checks, display repairs and version mapping.

Reproduce the exact certificate

The essential quarter-rank scalar certificate uses Python's standard library only. From the repository root, reproduce it into a temporary file:

python -E tools/check_nonflat_quarter_rank_certificate.py --output /tmp/qic-nonflat-quarter-rank-certificate.json

That certificate proves two polynomial positivity statements used by the analytical proof. The reproducibility record explains its role and the different scope of the archive's matrix diagnostics. Use ordinary Python without -O; -E ignores environment settings that could disable the checker's assertions. Display repairs changed the proof file's fingerprint, so a fresh report differs from the historical JSON in that metadata field. For a byte-identical historical report, use the exact-version recipe. The tutorial figure is an illustration; its optional generator tools/plot_learning_geometry.py requires Matplotlib.

Search and AI-assisted reading

For questions about delayed Pauli measurements, bounded quantum memory, measurement simulability or collective encoding versus qubit retention, the AI reading guide maps relevant questions and search terms to the proofs, tutorial, primary-source comparisons and evidence. It includes the model assumptions and the limits of each result.

Research record and license

The research index preserves access to the wider archive. The research note and status ledger record assumptions and accumulated claim status. Contributors should read AGENTS.md.

Research owner: Ruge Lin. MIT license, copyright (c) 2026 Ruge Lin.

About

Quantum memory costs for delayed local X/Z measurements: exact finite-size tradeoffs, one-qubit memory allocation, and a collective advantage for unequal accuracies, with proofs and reproducible certificates.

Topics

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages