Pith. sign in

REVIEW 3 major objections 4 minor 300 references

This paper claims that mitten codes, a family of non-abelian lifted product codes, reach 20% encoding rate and distances 18–24 with only hundreds of qubits, and that with a fast decoder they can sustain about 10^10 logical operations under

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-03 00:22 UTC pith:M6IBYFHE

load-bearing objection Mitten codes are a genuinely new construction with solid structural proofs; the processor-level error numbers are honest simulations under a no-idling-noise model that materially limits their meaning for neutral-atom hardware. the 3 major comments →

arxiv 2607.28795 v1 pith:M6IBYFHE submitted 2026-07-30 quant-ph

High-rate qLDPC processors

Aditya Bhardwaj , Muzhou Ma , Nadine Meister , Robbie King , Dolev Bluvstein , John Preskill , Madelyn Cain , Qian Xu
show 1 more author
Hsin-Yuan Huang
This is my paper
classification quant-ph MSC 81P7094B05 PACS 03.67.Pp
keywords quantum error correctionqLDPC codeslifted product codesnon-abelian groupsfault-tolerant quantum computationcode surgerymagic state injectionneutral atom quantum computing
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper introduces mitten codes, a family of quantum low-density parity-check (qLDPC) codes built from non-abelian groups. The non-abelian structure escapes a distance bound that caps abelian designs, so a 540-qubit code can have distance 18 and a 975-qubit code roughly distance 24, each at 20% encoding rate. The authors show how to turn these codes into a full fault-tolerant processor: five reusable surgery gadgets provide Clifford logic, high-rate gadgets measure many logical products at once, and magic states can be injected into all logical qubits in parallel. Using a staged decoder in circuit-level simulations, they report block logical error rates around 10^-11 per round at 0.1% physical error, and a processing capacity consistent with 10^10 logical operations. If correct, this would make practical fault-tolerant quantum computation feasible on near-term neutral-atom and superconducting hardware with a manageable qubit count.

Core claim

The central claim is that taking the lifted product of two 1x2 classical matrices over the group algebra of a non-abelian group, with the left and right regular representations full-rank, yields codes with 20% encoding rate, check weight 9, and distances reaching 18 or more with only a few hundred physical qubits. The same full-rank condition produces a canonical logical basis in which every logical X and Z operator is a group-action image of one seed operator, so that the entire logical toolkit reduces to two seed surgery gadgets plus a few bridged gadgets. Under a uniform depolarizing circuit-level noise model, the [300,60,14] code attains about 10^-11 block logical error per round, and th

What carries the argument

The central object is the mitten code: a lifted product code LP(A,B) with 1x2 base matrices A=[a0 a1] and B=[b0 b1] over the group algebra F2[G] for a non-abelian group G, where L(a1) and R(b1) are full-rank. This full-rank 'square invertibility' condition is what forces a canonical logical basis with single-orbit group symmetry, letting one rewired seed gadget measure any logical operator. The parity-check matrices have a five-block 'mitten' shape that interleaves left and right regular representations. The telescoping decoder is a staged pipeline that uses belief propagation and Relay-BP on GPU to quickly decode easy shots, then sends a small residual of harder shots to an exact integer-pr

Load-bearing premise

The headline processor-capacity numbers rest on a circuit-level noise model with depolarizing gate and measurement noise but no idling noise, while the three largest code distances are certified by estimates rather than proofs; if real hardware adds idle decoherence and atom loss during the 5–24 ms syndrome-extraction cycle, or if the estimated distances are off, the claimed 10^-11 per-round and 10^10-quop figures could degrade.

What would settle it

Simulate or run the [300,60,14] and [540,108,18] codes with a noise model that adds idle decoherence, atom loss, and movement error at 0.1% per gate; if observed per-round logical error rates rise above roughly 10^-8 or processing capacity falls below 10^8 quops, the central capacity claim fails. Independently, compute the exact distance of the [975,195,<=24] code; if it turns out to be below about 18, the high-distance claim fails.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • A single [300,60,14] block would run roughly a billion logical operations between errors at 0.1% physical gate error, enough for many small fault-tolerant algorithms.
  • The 20% encoding rate means about five physical qubits per logical qubit, roughly an order of magnitude fewer than surface-code stacks of comparable distance.
  • Parallel magic-state injection into all logical qubits at once removes the usual magic-state bottleneck that dominates spacetime overhead in surface-code architectures.
  • The decoder's estimated sub-millisecond latency fits inside the 5–24 ms syndrome-extraction cycle of neutral-atom hardware, keeping open the route to real-time decoding.
  • The 540-qubit distance-18 code reaches a 10^10-quop regime, a scale relevant for algorithmic demonstrations rather than only memory benchmarks.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The paper's simulations exclude idle-time decoherence and atom-movement errors; adding those to the noise model is the most direct test of whether the claimed error rates survive on real neutral-atom hardware.
  • The single-orbit symmetry likely extends beyond the specific mitten instances found here, suggesting a broader design space for any lifted product code with a square-invertible base matrix over a non-abelian group.
  • A natural next step is to simulate a complete end-to-end circuit that includes magic-state distillation and consumption, measuring wall-clock throughput in addition to per-round logical error rate.
  • If the estimated distances of the larger instances are certified exactly, the same group-searching pipeline may yield distance-30-plus codes in under 1500 qubits with only modest changes to the group or base matrices.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper introduces mitten codes, a family of qLDPC codes constructed as 1×2 lifted products over non-abelian group algebras, and argues that they satisfy four processor desiderata: 20% encoding rate, check weight 9, hardware-friendly layouts, and fast decoding. The central structural contributions are a canonical logical basis obtained from the group action (Theorem 4), distance upper bounds for lifted products (Theorem 8), explicit surgery and extractor gadgets, a distance-preserving parallel magic-state injection scheme (Theorem 7), and a proof that the codes have planar thickness three (Theorem 15). The paper also reports an end-to-end design pipeline built on sQetch, a GPU-based distance estimator, and Monte Carlo decoding results: a [300,60,14] code with block logical error rate ~10^-11 per round at 0.1% PER, and a [540,108,18] code with 2 logical failures in 15 billion surgery experiments, quoted as a ~10^10-quop processing capacity. The simulations use circuit-level depolarizing noise on state preparation, two-qubit gates, and measurements, with no idling noise.

Significance. If the structural and performance claims hold, this is a substantial step toward practical qLDPC processors: the 1/5 rate at block sizes of a few hundred qubits, the group-orbit logical basis, and the modular five-gadget Clifford toolkit are notable and well-motivated. The paper is commendably explicit: it provides concrete code instances, exact distances for the first five codes, open-source pipeline components, and Monte Carlo data with Clopper-Pearson intervals and an exact integer-programming decoding stage. However, the headline quantitative claims—10^-11 per round and ~10^10 quops—are obtained under a no-idling noise model and are therefore not directly transferable to the neutral-atom hardware the paper targets.

major comments (3)
  1. [Section V, Fig. 2 caption, Table I] The processor-capacity claims are load-bearing and are generated with 'no idling noise' (Fig. 2 caption). For the neutral-atom implementation, Table I lists syndrome-extraction cycles of 5–24 ms, during which data qubits idle and ancillas are transported by AODs. Under even a conservative T2 ~ 1 s, idle dephasing alone contributes ~1 − exp(−10 ms/1 s) ≈ 1% error per cycle, an order of magnitude above the 0.1% PER used in the simulations; atom loss and movement errors are also omitted. Consequently, the abstract's 'capable of running ~10^10 logical operations' and the related quantitative claims are not estimates for the hardware discussed. The paper is transparent about this assumption, but the claims in the abstract and conclusion should be restricted to the no-idling model or supplemented with a hardware-realistic idle/transport noise model.
  2. [Table I, Section V, Appendix H.5] Distances of the three largest instances (J630,126,≤20K, J780,156,≤22K, J975,195,≤24K) are estimates from sQetch and BP+OSD, not exact values, and the syndrome-extraction schedules are described as 'likely preserve' or 'verified with sQetch' rather than proven to preserve circuit-level distance. The abstract's 'distance 18 and beyond' is exactly supported only up to the [540,108,18] code; the performance of the [975,195,≤24] code and of all memory/surgery experiments depends on estimated distances. Because sQetch is a heuristic estimator, the possibility of a lower actual distance or a schedule-induced distance collapse is not excluded. Please either provide exact certificates/proofs for the reported distances and schedule fault-tolerance, or clearly label all performance claims that depend on these estimates as conditional.
  3. [Section V, Fig. 2(b)] The claim of a '~10^10-quop processor' rests on two logical failures in 15 billion surgery experiments. The Clopper-Pearson interval reported by the authors (1.33^{+1.76}_{−0.86}×10^-10) already shows a factor-of-several uncertainty, and the statement that the code is 'capable' of 10^10 quops is a consistency extrapolation rather than a direct demonstration. The phrase 'without extrapolation' is used only for the memory rate, but the processing-capacity summary in the abstract and conclusion should distinguish between the measured two-failure result and the inferred capacity.
minor comments (4)
  1. [Abstract and Conclusion] The no-idling assumption should be restated wherever 'capable of running ~10^10 logical operations' appears, so that hardware-readiness claims are not separated from the noise model that produced them.
  2. [Table I] The distance column mixes exact and estimated values. Consider adding a symbol or footnote that explicitly marks which entries are exact and which are upper-bound estimates from sQetch, and mirror this in the abstract's 'distance 18 and beyond' statement.
  3. [Fig. 2(b)] The notation '(1B X, 1B Z)' and 'R=13' is not self-explanatory. Define whether these are numbers of shots, number of rounds per shot, or total syndrome-extraction rounds, so the reader can reconstruct the reported logical-error-rate denominators.
  4. [Appendix H] The claims about sQetch being up to 800,000× faster are impressive but should be accompanied by a reproducible benchmark procedure, including hardware, dataset, and the exact version/commit of the repository referenced as [61].

Circularity Check

0 steps flagged

No circular derivation: mitten-code parameters, distances, and error rates are obtained from explicit constructions, exact/estimated computations, and Monte Carlo simulations, not from fitted inputs or self-citations.

full rationale

The central claims of the paper are self-contained rather than circular. Mitten codes are explicitly defined by base matrices over a non-abelian group algebra (Definition 4), and the claimed parameters—rate 20%, check weight 9, exact distances for the first five instances, canonical logical basis, gadget overheads, and decoder performance—are supported by concrete algebraic proofs, explicit code data (Table XIII), exact or clearly labeled estimated distance computations, and Stim-based circuit-level Monte Carlo simulation. No fitted parameter is dressed as a prediction: the reported logical error rates come from direct simulation outcomes (e.g., one error in ~10^11 syndrome extraction rounds for the [300,60,14] code, two failures in 15 billion surgery experiments for the [540,108,18] code), and the decoder's final stage is an exact integer-programming decoder benchmarked against external decoders (Tesseract, Cascade) on the gross code. Self-citations are present—[55], [56], [61], [79] are by overlapping authors—but they are used for construction frameworks, hardware estimates, and the sQetch tool, not as the sole load-bearing justification for the mitten-code-specific results. The sQetch distance estimator is open-source code and is used as a computational tool; the distances of the last three codes are explicitly marked as estimates rather than exact predictions. The paper is transparent that the simulation model applies uniform depolarizing noise to state preparation, two-qubit gates, and measurements with no idling noise (Fig. 2 caption), which is a genuine limitation for the neutral-atom extrapolation given the 5–24 ms SE cycles in Table I, but that is a modeling limitation, not circular reasoning. The circuit-level distances being 'likely preserved' via sQetch for some schedules is an acknowledged uncertainty, not an input renamed as an output. Therefore the derivation chain does not reduce to its own inputs, and the circularity score is 0.

Axiom & Free-Parameter Ledger

3 free parameters · 9 axioms · 2 invented entities

The central construction rests on standard module theory over F2[G] plus explicit rank conditions; the performance numbers rest on the circuit-level depolarizing noise model (no idling) and on the authors' decoder. No physical constant or fitted parameter is used to produce the claimed logical error rates; the free parameters are engineering choices (decoder dispatch, surgery R, transport inputs) that set the context of the claims rather than their content.

free parameters (3)
  • Surgery syndrome-extraction rounds R = R = 11, 13, 13, 15, 19 across experiments (Fig. 2(b))
    The quoted 'per quop' logical error rates are defined relative to the chosen R for each surgery experiment. The paper states all observed failures in the X basis are timelike errors, so larger R would suppress error rates further; the rates are conservative in R, but the quop capacity is R-dependent.
  • Telescoping decoder stage thresholds = BP/Relay-BP iteration counts and dispatch criteria (Appendix I, not stated numerically in main text)
    Hand-chosen thresholds decide which shots pass to the exact integer-programming stage. These affect decoder accuracy and the claimed sub-millisecond latency estimates, though not the coded instance parameters. They are engineering choices, not physics fits.
  • Neutral-atom transport parameters = Taken from Ref [91] (demonstrated AOD transport)
    SE cycle-time estimates of 5-24 ms (2 AOD pairs) assume literature transport speeds. These are inputs from prior experiments, not fitted here, but they set the hardware-feasibility claims.
axioms (9)
  • standard math Group-algebra module theory over F2[G]; regular representation identities L(g)h=gh, R(g)h=hg^{-1} (Appendix A).
    Invoked throughout the LP construction, the canonical logical basis, and the surgery gadgets.
  • standard math Cheeger inequality λ2/2 ≤ h(G) (Theorem 5, citing Chung [111]).
    Used to certify expansion and hence distance preservation of the larger surgery and extractor gadgets where exact Cheeger computation is infeasible.
  • standard math Künneth formula and collapse of the Künneth spectral sequence (Appendix B.3, citing Weibel [108]).
    Provides the homological derivation of the canonical logical basis under the square-invertibility condition.
  • domain assumption Circuit-level uniform depolarizing noise of strength p on state preparation, two-qubit gates, and measurements, with no idling noise (Section V, Fig. 2 caption).
    All headline logical error rate and processing capacity claims rest on this model. It is stated openly, but it omits idle decoherence, atom loss, and movement errors that are physically relevant to the neutral-atom platform with 5-24 ms SE cycles.
  • domain assumption Stim simulator [80] faithfully simulates the circuit-level noise model.
    Standard community assumption; all Monte Carlo numbers are generated with Stim.
  • domain assumption Randomized distance estimation (50M sQetch iterations + 50k BP+OSD runs) suffices to report distances ≤20, ≤22, ≤24 for the three largest instances (Table I).
    Distances of 3 of 8 codes are upper-bound estimates from a randomized search for low-weight logicals, not proofs. The paper is transparent via the ≤ notation, but the claimed 'distance 18 and beyond' family-level statement leans on these estimates.
  • ad hoc to paper sQetch-verified SE schedules (hook-error-free or random coloration) preserve circuit-level distance (Section V, Appendix H.5).
    The paper states schedules are searched to 'likely preserve' the circuit-level distance; a probabilistic estimate rather than a proof is load-bearing for the simulation results.
  • ad hoc to paper Full-rank condition on L(a1) and R(b1) ('square invertibility condition', Definition 16).
    Defining constraint of the mitten family; it guarantees the canonical single-orbit logical basis, but restricts which non-abelian groups and entries are admissible.
  • domain assumption Surgery with R rounds fault-tolerantly implements the logical measurement; observed failures are timelike (Section V).
    Per-quop error rates are quoted with finite R; the paper notes that increasing R suppresses the observed errors, so the quop capacity is a function of the protocol's round budget.
invented entities (2)
  • Mitten codes (non-abelian 1x2 lifted product code family) independent evidence
    purpose: Rate-1/5, check-weight-9 quantum LDPC processor codes with a single-orbit canonical logical basis enabling low-overhead universal logic.
    Explicit check matrices (Eq. 2) and construction data (Table XIII); distances computed exactly (first five) or bounded by two independent estimators (last three). Falsifiable by re-deriving the code parameters; not circular.
  • Magic port code LP(Rep(d_rep), B) independent evidence
    purpose: Ancillary lifted product code bridging surface-code magic-state factories to the mitten processor for parallel |T> injection.
    Distance exactly min(d_rep, d_B) proven in Theorem 6; explicit block check matrices in Fig. 7. The distance is proven rather than assumed, so the entity carries independent evidence.

pith-pipeline@v1.3.0-alltime-deepseek · 62651 in / 23744 out tokens · 240709 ms · 2026-08-03T00:22:48.328446+00:00 · methodology

0 comments
read the original abstract

Despite significant progress on quantum low-density parity-check (qLDPC) codes, building qLDPC processors that are high-rate, high-throughput, hardware-friendly, and fast-to-decode remains a challenge. We introduce mitten codes, a family of qLDPC processor codes of encoding rate $20\%$ and check weight $9$, based on non-abelian groups. Their non-abelian structure evades distance bounds constraining abelian counterparts, allowing mitten codes to reach distance $18$ and beyond with just a few hundred data qubits. The logical operators of a mitten code are related by the group action, yielding a modular, low-overhead logical toolkit: full Clifford operations follow from bridging two reusable seed surgery gadgets or from a single fixed extractor. Furthermore, qLDPC processors based on mitten codes support high-rate surgery that executes many logical measurements in parallel, and parallel magic-state injection into all logical qubits at once. Under circuit-level noise, with our fast decoder, the $[\![300,60,14]\!]$ mitten code achieves, without extrapolation, a block logical error rate of ${\sim}10^{-11}$ per round at $0.1\%$ physical error rate (PER), while the $[\![ 975,195,\leq 24 ]\!]$ code reaches ${\sim}10^{-8}$ at $0.4\%$ PER. Decoding $15$ billion surgery experiments on the $[\![540,108,18]\!]$ code at $0.1\%$ PER, we observe only two logical failures, demonstrating a qLDPC processor capable of running ${\sim}10^{10}$ logical operations. Our decoder is compatible with sub-millisecond average latency per logical cycle, sufficient for real-time decoding on neutral atom hardware. Discovered by an end-to-end design pipeline built on sQetch, a distance estimator orders of magnitude faster than existing tools, and mapping efficiently onto near-term neutral atom and superconducting hardware, mitten codes open a practical path toward fault-tolerant quantum computation.

Figures

Figures reproduced from arXiv: 2607.28795 by Aditya Bhardwaj, Dolev Bluvstein, Hsin-Yuan Huang, John Preskill, Madelyn Cain, Muzhou Ma, Nadine Meister, Qian Xu, Robbie King.

Figure 1
Figure 1. Figure 1: Mitten codes as fault-tolerant qLDPC processors (a) The J200, 40, 12K mitten code built from the lifted product of base matrices 𝐴 and 𝐵 defined over the group algebra 𝐹2[𝐺] of the non-abelian group 𝐺 = 𝐶4 × 𝐷10. The code consists of five blocks 𝐷1, . . . , 𝐷5 of |𝐺| = 40 physical data qubits and two blocks each of 𝑋-check and 𝑍-check ancilla qubits. Grey lines show the block-wise connectivity, while the c… view at source ↗
Figure 2
Figure 2. Figure 2: Performance of mitten codes as qLDPC processors using our telescoping decoder. All simulations are performed under circuit-level noise with uniform depolarizing noise of strength 𝑝 applied to state preparation, two-qubit gates, and measurements, with no idling noise. (a) Memory performance of mitten codes. We plot the logical error rate per syndrome extraction round averaged over an equal number of 𝑋 and 𝑍… view at source ↗
Figure 3
Figure 3. Figure 3: High-rate qLDPC processor discovery pipeline. Starting from the processor targets of Definition 3, the pipeline narrows the design space in three levels. The first level explores the space of groups and base matrices: theoretical distance bounds (Appendix G) first constrain the search space, and the fast code￾distance estimator sQetch (Appendix H) then brute-force searches the remaining space to find codes… view at source ↗
Figure 4
Figure 4. Figure 4: Hardware implementation. (a) In neutral atom hardware, each gate layer of syndrome extraction is implemented by entangling blocks of checks with corresponding blocks of data qubits, and permuting check qubits between layers. Here we show an example 𝑋-check qubit permutation for the J150, 30, 10K code (𝐺 = 𝐶5 × 𝑆3), for which the check qubit permutations between layers 𝐿(𝑟 2 ) and 𝐿(𝑥 · 𝑠𝑟2 ) correspond to … view at source ↗
Figure 5
Figure 5. Figure 5: Surgery gadgets. (a) The seed graph surgery gadgets for measuring logical 𝑋¯/𝑍¯ operators constructed based on the group-structured canonical logical basis (Appendix B) where different logical operators are related by group action 𝑔 and the seed gadgets can be used to measure all |𝐺| of them within an orbit by rewiring. (b) 𝑋¯𝑋¯, 𝑍¯𝑍¯ and 𝑌¯ graph surgery gadgets constructed by bridging the seed gadgets fr… view at source ↗
Figure 6
Figure 6. Figure 6: Parallel magic state injection scheme for mitten processor code [PITH_FULL_IMAGE:figures/full_fig_p049_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Block-labeled check matrices of LP(Rep(𝑑rep), 𝐵) Theorem 6. The distance of LP(Rep(𝑑rep), 𝐵) is the minimum of 𝑑𝐵 = 𝑑(𝑅(𝐵)) and 𝑑rep: 𝑑(LP(Rep(𝑑rep), 𝐵)) = min(𝑑rep, 𝑑𝐵). (E1) Proof. By Theorem 8, 𝑑(LP(Rep(𝑑rep), 𝐵)) ≤ min(𝑑rep, 𝑑𝐵). We therefore focus on the other direction, i.e. proving 𝑑(LP(Rep(𝑑rep), 𝐵)) ≥ min(𝑑rep, 𝑑𝐵). As presented in [PITH_FULL_IMAGE:figures/full_fig_p050_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Wall-clock time, in days on a logarithmic scale, required to screen approximately [PITH_FULL_IMAGE:figures/full_fig_p070_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Decoder comparison on the J144, 12, 12K gross code. We plot the logical error rate per round per logical qubit for memory experiments under uniform depolarizing circuit-level noise at physical error rates 𝑝 = 0.1% and 𝑝 = 0.2%, using the detector error models of Ref. [122]. For our telescoping decoder, we averaged the logical error rate over 𝑋 and 𝑍 basis experiments with an equal number of shots in each b… view at source ↗
Figure 10
Figure 10. Figure 10: Example atom movement in the SE cycle for the [PITH_FULL_IMAGE:figures/full_fig_p080_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Example atom movement in the SE cycle for the [PITH_FULL_IMAGE:figures/full_fig_p082_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: SE cycle time for mitten codes and structured mitten codes. To represent current day hardware, [PITH_FULL_IMAGE:figures/full_fig_p083_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: Thickness-3 decomposition of the Tanner graph of a mitten code, illustrated for the nonabelian [PITH_FULL_IMAGE:figures/full_fig_p088_13.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

300 extracted references · 14 canonical work pages

  1. [1]

    Naval research logistics quarterly , volume=

    The Hungarian method for the assignment problem , author=. Naval research logistics quarterly , volume=. 1955 , publisher=

    1955

  2. [2]

    arXiv preprint arXiv:2603.02157 , year=

    Constant-Time Surgery on 2D Hypergraph Product Codes with Near-Constant Space Overhead , author=. arXiv preprint arXiv:2603.02157 , year=

    arXiv

  3. [3]

    arXiv preprint arXiv:2510.04521 , year=

    Fast surgery for quantum LDPC codes , author=. arXiv preprint arXiv:2510.04521 , year=

    arXiv

  4. [4]

    classical binding, and obfuscating permutations , author=

    On one-shot signatures, quantum vs. classical binding, and obfuscating permutations , author=. Annual International Cryptology Conference , pages=. 2025 , organization=

    2025

  5. [5]

    2025 , eprint=

    Exponent and number of generators in a finite group , author=. 2025 , eprint=

    2025

  6. [6]

    Physical Review X , volume=

    Continuous-variable quantum state designs: Theory and applications , author=. Physical Review X , volume=. 2024 , publisher=

    2024

  7. [7]

    arXiv preprint arXiv:2505.10110 , year=

    The non-Clifford cost of random unitaries , author=. arXiv preprint arXiv:2505.10110 , year=

    Pith/arXiv arXiv

  8. [8]

    Journal of Mathematical Physics , volume=

    Existence of universal entangler , author=. Journal of Mathematical Physics , volume=. 2008 , publisher=

    2008

  9. [9]

    Physical Review X , volume=

    Maximum entropy principle in deep thermalization and in hilbert-space ergodicity , author=. Physical Review X , volume=. 2024 , publisher=

    2024

  10. [10]

    International Journal of Quantum Information , volume=

    Limitations on quantum dimensionality reduction , author=. International Journal of Quantum Information , volume=. 2015 , publisher=

    2015

  11. [11]

    arXiv preprint arXiv:2510.05531 , year =

    Efficient learning of bosonic Gaussian unitaries , author =. arXiv preprint arXiv:2510.05531 , year =. 2510.05531 , archivePrefix =

    Pith/arXiv arXiv

  12. [12]

    and Quiskamp, Aaron P

    McAllister, Ben T. and Quiskamp, Aaron P. and Tobar, Michael E. , year=. Tunable rectangular resonant cavities for axion haloscopes , volume=. Physical Review D , publisher=. doi:10.1103/physrevd.109.015013 , number=

    work page doi:10.1103/physrevd.109.015013

  13. [13]

    2025 , eprint=

    The symplectic rank of non-Gaussian quantum states , author=. 2025 , eprint=

    2025

  14. [14]

    Clément Canonne , year=. Testing

  15. [15]

    2020 , journal=

    Principles of Quantum Communication Theory: A Modern Approach , author=. 2020 , journal=

    2020

  16. [16]

    2025 , eprint=

    Efficient Hamiltonian, structure and trace distance learning of Gaussian states , author=. 2025 , eprint=

    2025

  17. [17]

    Optimal estimates of trace distance between bosonic Gaussian states and applications to learning , volume=

    Bittel, Lennart and Mele, Francesco Anna and Mele, Antonio Anna and Tirone, Salvatore and Lami, Ludovico , year=. Optimal estimates of trace distance between bosonic Gaussian states and applications to learning , volume=. doi:10.22331/q-2025-06-12-1769 , journal=

    work page doi:10.22331/q-2025-06-12-1769 2025

  18. [18]

    2024 , eprint=

    On estimates of trace-norm distance between quantum Gaussian states , author=. 2024 , eprint=

    2024

  19. [19]

    2024 , eprint=

    Learning quantum states of continuous variable systems , author=. 2024 , eprint=

    2024

  20. [20]

    2017 , publisher=

    Quantum continuous variables: A primer of theoretical methods , author=. 2017 , publisher=

    2017

  21. [21]

    2018 , eprint=

    A quantum Johnson-Lindenstrauss lemma via unitary t-designs , author=. 2018 , eprint=

    2018

  22. [22]

    Fundamental limits of repeaterless quantum communications , volume =

    Pirandola, Stefanno and Laurenza, Riccardo and Ottaviani, Carlo and Banchi, Leonardo , doi =. Fundamental limits of repeaterless quantum communications , volume =. Nature Comm. , number =

  23. [23]

    Ultimate Precision of Adaptive Noise Estimation , author =. Phys. Rev. Lett. , volume =. 2017 , publisher =

    2017

  24. [24]

    and Chakram, Srivatsan and He, Kevin and Agrawal, Ankur and Naik, Ravi K

    Dixit, Akash V. and Chakram, Srivatsan and He, Kevin and Agrawal, Ankur and Naik, Ravi K. and Schuster, David I. and Chou, Aaron , year=. Searching for Dark Matter with a Superconducting Qubit , volume=. Physical Review Letters , publisher=. doi:10.1103/physrevlett.126.141302 , number=

    doi:10.1103/physrevlett.126.141302

  25. [25]

    2017 , eprint=

    Energy-constrained diamond norm with applications to the uniform continuity of continuous variable channel capacities , author=. 2017 , eprint=

    2017

  26. [26]

    On the Energy-Constrained Diamond Norm and Its Application in Quantum Information Theory

    Shirokov, Maxim E. On the Energy-Constrained Diamond Norm and Its Application in Quantum Information Theory. Probl. Inf. Transm. 2018. doi:10.1134/S0032946018010027

    doi:10.1134/s0032946018010027 2018

  27. [27]

    Terhal, B. M. and DiVincenzo, D. P. and Leung, D. W. , journal =. Hiding Bits in. 2001 , publisher =

    2001

  28. [28]

    DiVincenzo, D. P. and Leung, D. W. and Terhal, B. M. , journal=. Quantum data hiding , year=

  29. [29]

    International Colloquium on Automata, Languages, and Programming , pages=

    Impossibility of a quantum speed-up with a faulty oracle , author=. International Colloquium on Automata, Languages, and Programming , pages=. 2008 , organization=

    2008

  30. [30]

    arXiv preprint arXiv:2410.18953 , year=

    The Learning Stabilizers with Noise problem , author=. arXiv preprint arXiv:2410.18953 , year=

    Pith/arXiv arXiv

  31. [31]

    2025 , eprint=

    Mind the Gap: Removing the Discretization Gap in Differentiable Logic Gate Networks , author=. 2025 , eprint=

    2025

  32. [32]

    arXiv preprint arXiv:2008.02217 , year=

    Hopfield networks is all you need , author=. arXiv preprint arXiv:2008.02217 , year=

    Pith/arXiv arXiv 2008

  33. [33]

    arXiv preprint arXiv:2411.04931 , year=

    Quantum Advantage with Faulty Oracle , author=. arXiv preprint arXiv:2411.04931 , year=

    Pith/arXiv arXiv

  34. [34]

    Proceedings of the 5th conference on Innovations in theoretical computer science , pages=

    Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements , author=. Proceedings of the 5th conference on Innovations in theoretical computer science , pages=

  35. [35]

    arXiv preprint arXiv:2502.18170 , year=

    Pauli measurements are not optimal for single-copy tomography , author=. arXiv preprint arXiv:2502.18170 , year=

    Pith/arXiv arXiv

  36. [36]

    arXiv preprint arXiv:2212.06084 , year=

    Hardware-efficient learning of quantum many-body states , author=. arXiv preprint arXiv:2212.06084 , year=

    Pith/arXiv arXiv

  37. [37]

    arXiv preprint arXiv:2005.04826 , year=

    Simpler proofs of quantumness , author=. arXiv preprint arXiv:2005.04826 , year=

    Pith/arXiv arXiv 2005

  38. [38]

    Binegativity and geometry of entangled states in two qubits , author =. Phys. Rev. A , volume =. 2004 , month =. doi:10.1103/PhysRevA.69.020301 , url =

    work page doi:10.1103/physreva.69.020301 2004

  39. [39]

    Computable Entanglement Cost under Positive Partial Transpose Operations , author =. Phys. Rev. Lett. , volume =. 2025 , month =. doi:10.1103/PhysRevLett.134.090202 , url =

    work page doi:10.1103/physrevlett.134.090202 2025

  40. [40]

    IEEE Transactions on Information Theory , volume=

    The intractability of computing the minimum distance of a code , author=. IEEE Transactions on Information Theory , volume=. 1997 , publisher=

    1997

  41. [41]

    arXiv preprint arXiv:2311.10971 , year=

    Tetrationally compact entanglement purification , author=. arXiv preprint arXiv:2311.10971 , year=

    Pith/arXiv arXiv

  42. [42]

    arXiv preprint arXiv:2505.05301 , year=

    Operator-Level Quantum Acceleration of Non-Logconcave Sampling , author=. arXiv preprint arXiv:2505.05301 , year=

    arXiv

  43. [43]

    arXiv preprint arXiv:2502.08721 , year=

    Complement Sampling: Provable, Verifiable and NISQable Quantum Advantage in Sample Complexity , author=. arXiv preprint arXiv:2502.08721 , year=

    arXiv

  44. [44]

    PRX Quantum , volume=

    Learning to predict arbitrary quantum processes , author=. PRX Quantum , volume=. 2023 , publisher=

    2023

  45. [45]

    Nature Communications , volume=

    Shadow hamiltonian simulation , author=. Nature Communications , volume=. 2025 , publisher=

    2025

  46. [46]

    arXiv preprint arXiv:2501.07625 , year=

    Quantum Computing Enhanced Sensing , author=. arXiv preprint arXiv:2501.07625 , year=

    Pith/arXiv arXiv

  47. [47]

    Physical review letters , volume=

    Longer-baseline telescopes using quantum repeaters , author=. Physical review letters , volume=. 2012 , publisher=

    2012

  48. [48]

    Physical review letters , volume=

    Dissipative quantum church-turing theorem , author=. Physical review letters , volume=. 2011 , publisher=

    2011

  49. [49]

    arXiv preprint arXiv:2310.02783 , year=

    Computational entanglement theory , author=. arXiv preprint arXiv:2310.02783 , year=

    Pith/arXiv arXiv

  50. [50]

    Physical Review Letters , volume=

    Perfect distinguishability of quantum operations , author=. Physical Review Letters , volume=. 2009 , publisher=

    2009

  51. [51]

    Physical review letters , volume=

    Statistical distinguishability between unitary operations , author=. Physical review letters , volume=. 2001 , publisher=

    2001

  52. [52]

    arXiv preprint arXiv:2408.03376 , year=

    Entanglement-enhanced learning of quantum processes at scale , author=. arXiv preprint arXiv:2408.03376 , year=

    Pith/arXiv arXiv

  53. [53]

    arXiv preprint arXiv:2411.04300 , year=

    Slow mixing of quantum gibbs samplers , author=. arXiv preprint arXiv:2411.04300 , year=

    Pith/arXiv arXiv

  54. [54]

    Nature physics , volume=

    Quantum computation and quantum-state engineering driven by dissipation , author=. Nature physics , volume=. 2009 , publisher=

    2009

  55. [55]

    Proceedings of the forty-seventh annual ACM symposium on Theory of computing , pages=

    Forrelation: A problem that optimally separates quantum from classical computing , author=. Proceedings of the forty-seventh annual ACM symposium on Theory of computing , pages=

  56. [56]

    and Altman, Ehud , year=

    Garratt, Samuel J. and Altman, Ehud , year=. Probing Postmeasurement Entanglement without Postselection , volume=. PRX Quantum , publisher=. doi:10.1103/prxquantum.5.030311 , number=

    doi:10.1103/prxquantum.5.030311

  57. [57]

    Huang, Hsin-Yuan and Liu, Yunchao and Broughton, Michael and Kim, Isaac and Anshu, Anurag and Landau, Zeph and McClean, Jarrod R. , year=. Learning Shallow Quantum Circuits , url=. doi:10.1145/3618260.3649722 , booktitle=

    arXiv

  58. [58]

    String operators for Cheshire strings in topological phases , volume=

    Tantivasadakarn, Nathanan and Chen, Xie , year=. String operators for Cheshire strings in topological phases , volume=. Physical Review B , publisher=. doi:10.1103/physrevb.109.165149 , number=

    doi:10.1103/physrevb.109.165149

  59. [59]

    Shi, Bowen and Kato, Kohtaro and Kim, Isaac H. , year=. Fusion rules from entanglement , volume=. doi:10.1016/j.aop.2020.168164 , journal=

    arXiv 2020

  60. [60]

    2024 , eprint=

    Learning State Preparation Circuits for Quantum Phases of Matter , author=. 2024 , eprint=

    2024

  61. [61]

    Journal of differential geometry , volume=

    Supersymmetry and Morse theory , author=. Journal of differential geometry , volume=. 1982 , publisher=

    1982

  62. [62]

    Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , pages=

    A polynomial quantum algorithm for approximating the Jones polynomial , author=. Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , pages=

  63. [63]

    arXiv preprint arXiv:0707.2831 , year=

    Estimating Jones polynomials is a complete problem for one clean qubit , author=. arXiv preprint arXiv:0707.2831 , year=

    Pith/arXiv arXiv

  64. [64]

    New Journal of Physics , volume=

    The BQP-hardness of approximating the Jones polynomial , author=. New Journal of Physics , volume=. 2011 , publisher=

    2011

  65. [65]

    Communications in Mathematical Physics , volume=

    Quantum field theory and the Jones polynomial , author=. Communications in Mathematical Physics , volume=. 1989 , publisher=

    1989

  66. [66]

    Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=

    Local minima in quantum systems , author=. Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=

  67. [67]

    Physical Review Letters , volume=

    Information-theoretic bounds on quantum advantage in machine learning , author=. Physical Review Letters , volume=. 2021 , publisher=

    2021

  68. [68]

    Machine Learning: Science and Technology , volume=

    Building high accuracy emulators for scientific simulations with deep neural architecture search , author=. Machine Learning: Science and Technology , volume=. 2021 , publisher=

    2021

  69. [69]

    Physical Review A , volume=

    Quantum-classical computation of Schwinger model dynamics using quantum computers , author=. Physical Review A , volume=. 2018 , publisher=

    2018

  70. [70]

    Quantum , volume=

    Provably accurate simulation of gauge theories and bosonic systems , author=. Quantum , volume=. 2022 , publisher=

    2022

  71. [71]

    Science , volume=

    Quantum algorithms for quantum field theories , author=. Science , volume=. 2012 , publisher=

    2012

  72. [72]

    arXiv preprint arXiv:1811.10085 , year=

    Simulating quantum field theory with a quantum computer , author=. arXiv preprint arXiv:1811.10085 , year=

    Pith/arXiv arXiv

  73. [73]

    Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=

    Quantum tomography using state-preparation unitaries , author=. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=. 2023 , organization=

    2023

  74. [74]

    Cahn, J. K. B. and Brinkmann-Chen, S. and Spatzal, T. and Wiig, J. A. and Buller, A. R. and Einsle, O. and Hu, Y. and Ribbe, M. W. and Arnold F. H. , year =. Cofactor specificity motifs and the induced fit mechanism in class. Biochemical Journal , volume =. doi:10.1042/BJ20150183 , addendum =

    work page doi:10.1042/bj20150183

  75. [75]

    Cahn, J. K. B. and Baumschlager, A. and Brinkmann-Chen, S. and Arnold, F. H. , journal=. Mutations in adenine-binding pockets enhance catalytic properties of. 2016 , publisher=. doi:10.1093/protein/gzv057 , addendum =

    work page doi:10.1093/protein/gzv057 2016

  76. [76]

    arXiv preprint arXiv:2210.14894 , year=

    Learning to predict arbitrary quantum processes , author=. arXiv preprint arXiv:2210.14894 , year=

    Pith/arXiv arXiv

  77. [77]

    arXiv preprint arXiv:2301.13169 , year=

    Improved machine learning algorithm for predicting ground state properties , author=. arXiv preprint arXiv:2301.13169 , year=

    Pith/arXiv arXiv

  78. [78]

    , month =

    Huang, Hsin-Yuan and Broughton, Michael and Mohseni, Masoud and Babbush, Ryan and Boixo, Sergio and Neven, Hartmut and McClean, Jarrod R. , month =. Power of data in quantum machine learning , url =. Nature Communications , number =. 2021 , bdsk-url-1 =. doi:10.1038/s41467-021-22539-9 , id =

    doi:10.1038/s41467-021-22539-9 2021

  79. [79]

    Albert and John Preskill , doi =

    Hsin-Yuan Huang and Richard Kueng and Giacomo Torlai and Victor V. Albert and John Preskill , doi =. Provably efficient machine learning for quantum many-body problems , url =. 2022 , bdsk-url-1 =. https://www.science.org/doi/pdf/10.1126/science.abk3333 , journal =

    doi:10.1126/science.abk3333 2022

  80. [80]

    Invited survey in CCC , volume=

    The learning with errors problem , author=. Invited survey in CCC , volume=. 2010 , publisher=

    2010

Showing first 80 references.