Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations
Abstract: Quantum simulation of fermionic Hamiltonians is a leading application of quantum computing, but accurate execution on present-day hardware is limited by error accumulation in deep Trotter circuits. We present a device-matched noise-reduction framework for encoded Hamiltonian simulation that combines symplectic-transvection-based Trotter synthesis in the Generalized Superfast Encoding (GSE) with Clifford Noise Reduction (CliNR) and Shor-style stabilizer verification enabled by mid-circuit measurement. We implement this approach for a six-qubit encoded Clifford Trotter step on a Barium development system similar to the forthcoming IonQ Tempo line and benchmark it against direct execution using both hardware experiments and a calibrated device-level noise model. The encoded CliNR execution achieves up to 54% lower logical error rate. Crucially, this advantage disappears when stabilizer readout is deferred to the end of the circuit, showing that timely mid-circuit fault detection, rather than verification overhead alone, drives the improvement. As a proof of concept, we further show that machine-learning-guided stabilizer selection can identify verification operators that outperform random choices. These results demonstrate that encoding-native verification combined with dynamic-circuit primitives can materially improve application-motivated quantum simulation without the full overhead of quantum error correction.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Explain it Like I'm 14
Simple overview
This paper is about making quantum computers better at simulating how tiny particles (like electrons) behave over time. Today’s quantum hardware still makes mistakes, especially in long calculations. The authors show a way to catch and filter out many of those mistakes in the middle of a computation, instead of waiting until the end. They combine three ideas—an efficient way to represent electrons on qubits, a “pre-check before use” trick for certain circuits, and safe ways to measure during a computation—and test it on a trapped‑ion quantum computer. They see up to 54% fewer errors compared with running the same simulation directly.
What the researchers wanted to find out
Put simply, they asked:
- Can we lower the error rate of a common quantum-simulation step by checking for faults while the circuit is still running?
- Is measuring “in the middle” of the circuit (instead of only at the end) the key to that improvement?
- Can we use machine learning to pick the best checks to perform, so we don’t waste time checking everything?
How they did it (in everyday language)
Think of building a model car:
- A “direct build” is snapping pieces together and hoping they’re fine.
- A “checked build” is assembling a sub-part, inspecting it, and only then attaching it to the main model. If the sub‑part fails inspection, you throw it out and try again—before it can ruin the rest.
That’s the basic idea here.
- The task: simulate evolution under a Hamiltonian (the math that describes how a quantum system changes). They use a standard technique called Trotterization, which breaks the change over time into many small steps. More steps usually means better accuracy but also more chances for errors to pile up.
- Encoding electrons onto qubits: They use Generalized Superfast Encoding (GSE). Think of GSE as a wiring plan that turns “electron rules” into qubit operations while keeping things local and lightweight. A nice bonus: GSE naturally comes with built‑in “checks” (called stabilizers), like having test points on a circuit board.
- Pre‑checking Clifford parts (CliNR): Many of the steps in Trotterization belong to a gate family called Clifford gates (which are easier to verify). Clifford Noise Reduction (CliNR) prepares the Clifford operation “off to the side” on extra qubits, checks it using stabilizers, and only then “teleports” its effect onto the real data. If the side-prep fails, the run is discarded before touching the data, limiting the spread of errors.
- Safe mid-circuit measurements (Shor-style): Measuring during a circuit can itself spread errors if done carelessly. The team uses ancilla qubits (helper qubits) and small “cat states” to read stabilizers in a way that confines errors, like wearing gloves while checking a hot part so you don’t burn the main assembly.
- Mid-circuit vs end-of-circuit readout: They tried two options—(1) measure, check, and reset ancillas immediately (“mid-circuit”), and (2) do the same measurement operations but wait to read them until the end. This isolates the effect of timing.
- Hardware and simulation: They ran the circuits on a barium trapped‑ion system (similar to IonQ Tempo) that supports mid-circuit measurement and also built a calibrated simulator with realistic noise. They compared:
- Direct Trotter step (baseline)
- CliNR with mid-circuit checks
- CliNR with checks measured only at the end
- Different choices and numbers of checks (stabilizers)
- Picking which checks to perform: There are many possible stabilizers; measuring more can help but adds cost. They use machine learning to choose promising stabilizers, instead of guessing at random.
Key jargon translated:
- Hamiltonian simulation: predicting how a quantum system evolves.
- Trotterization: slicing time into small steps and applying simpler pieces in sequence.
- Clifford gates: a set of quantum gates that are easier to analyze and verify.
- Stabilizers: parity checks that tell you if the state is still “legal” under your code.
- Mid-circuit measurement: measuring and possibly resetting qubits during a circuit, not just at the end.
- Teleporting an operation: using entanglement and measurements to apply an operation to your data without directly running it on the data.
What they found and why it matters
- Up to 54% fewer logical errors: When they prepared and verified the Clifford step off‑data and used mid-circuit measurements to catch problems early, the resulting simulation output was much closer to ideal.
- Timing matters: If they delayed reading the check results until the end of the circuit, the advantage mostly disappeared. This shows it’s not just “doing extra checks” that helps—it’s catching and rejecting bad runs before they contaminate the computation.
- Better in two ways: The improved circuits both (1) reduced the chance of ending up in the completely wrong answer sector and (2) reduced bias between the two correct outcomes (a sign that certain subtle errors were less likely to sneak through).
- Simulations mostly agreed, but missed the timing effect: Their calibrated simulator matched the overall trend (checks help), but didn’t show extra benefit from mid-circuit timing. That suggests the real hardware has additional noise sources (like crosstalk) not captured in the simple model—and that mid-circuit measurements help deal with those real-world effects.
- Smarter stabilizer choices help: A machine-learning model could pick verification checks that performed better than randomly chosen ones, pointing toward practical ways to get more improvement with less overhead.
Why this is important
Full quantum error correction (QEC) will eventually make long, accurate computations possible, but it’s still very costly today. This work shows a practical middle ground:
- By using the structure already present in a simulation (Clifford-heavy steps and GSE stabilizers) and by measuring during the circuit, we can make meaningful progress right now—without the full burden of QEC.
- Mid-circuit measurement is not just a nice extra; it’s crucial. Devices that support it can meaningfully reduce errors in real, application‑motivated simulations.
- Smarter, device‑matched strategies (like choosing stabilizers with machine learning and compiling resource states to match the hardware’s native gates) can push performance further.
- This approach can help bring useful quantum simulations—like studying molecules and materials—closer on near‑term hardware, while also informing how to integrate similar ideas with future error-corrected systems.
Knowledge Gaps
Knowledge gaps, limitations, and open questions
The paper leaves several concrete avenues for future work unresolved. Below is a single, focused list of gaps that, if addressed, could meaningfully extend or validate the reported results:
- Generalization beyond Clifford blocks: assess whether the CliNR+GSE benefits persist for non-Clifford product-formula rotations (small-angle evolutions typical in realistic Hamiltonian simulation), including the overhead and stability of repeated teleportations with real-time Pauli frame updates.
- Multi-step dynamics: quantify how advantages accumulate or degrade across many Trotter steps (including inter-step feed-forward and ancilla reuse), and identify when verification overhead outweighs benefits as depth grows.
- Trotter error vs. noise trade-offs: study how product-formula approximation error interacts with error-detected execution (e.g., does verification exacerbate ordering errors or bias outcomes for non-Clifford angles?).
- Scaling with code size and distance: evaluate performance for larger GSE instances (more fermionic modes) and higher-distance error-detecting/correcting codes; characterize resource overhead, stabilizer weight growth, and acceptance rates as n and d increase.
- Acceptance rates and throughput: report and model acceptance probabilities for each verification schedule; quantify effective time-to-solution, shot overhead, and total sampling cost compared to the baseline.
- Stabilizer measurement scheduling: determine optimal number, placement, and weights of stabilizers (e.g., short vs. long checks) as a function of hardware noise and resource-state structure; develop principled heuristics or bounds.
- ML-guided stabilizer selection details: specify features, training data, labels/targets, and model architectures; validate predictions on hardware; assess generalization across graph-state compilations, circuit instances, and hardware conditions.
- Joint optimization of resource-state compilation and verification: co-design graph-state choice and stabilizer schedule to minimize entangling gates while maximizing detection power; quantify the trade-off empirically.
- Hardware noise modeling: extend the Pauli-channel model to include crosstalk, coherent over-rotations, amplitude damping, leakage dynamics, measurement backaction, motional-mode cross-coupling, and non-Markovian effects—especially those that make mid-circuit measurement timing consequential.
- Origin of subspace bias: identify and model the hardware mechanisms behind the observed bias between the (1,1,0) and (0,1,1) outcomes (not captured by the current Clifford noise model); test mitigations.
- Shor-style extraction specifics: clarify whether verified cat states were prepared and how; quantify faults introduced by cat-state/flag/Steane-style alternatives; compare extraction methods and their overhead vs. benefit on this hardware.
- Measurement and reset latencies: characterize the impact of mid-circuit measurement timing and reset-induced idling on both data and ancillas; evaluate whether improved latency or pipelining changes the MCM vs. ECM advantage.
- Teleportation feed-forward in real time: move from post-processing to true real-time Pauli frame updates; quantify latency, compilation overhead, and accumulated idle errors in repeated steps.
- Comparative baselines: benchmark against alternative low-overhead strategies (e.g., symmetry postselection without resource teleportation, randomized compiling, zero-noise extrapolation, probabilistic error cancellation, on-data flag gadgets) to position CliNR’s relative benefit-cost profile.
- Portability across platforms: test the approach on other hardware (superconducting qubits, neutral atoms) with different native gates and readout latencies; assess how device-specific constraints affect verification scheduling and gains.
- Observable-level impact: evaluate improvements on chemically relevant observables and correlation functions (not just TVD over decoded occupations), including sensitivity to small-angle errors and phase coherence.
- Error taxonomy: characterize which fault classes are detected vs. missed by selected stabilizers; measure false-accept/false-reject rates and how these scale with the number/weight of checks.
- Mapping-induced bias: systematically control for the mapping advantage of the 6-qubit baseline (best pairs) vs. wide CliNR circuits (wider, noisier subset); re-run with matched pair-quality distributions or normalized per-pair fidelities.
- Resource overhead thresholds: identify regimes (gate fidelities, measurement fidelities, latency) where additional stabilizers begin to harm performance; derive predictive thresholds for “verify more” vs. “verify less.”
- Cat-state length and verification cost: map performance as a function of stabilizer weight and cat-state length, including the cost of cat-state verification and its error propagation risks.
- Interleaved MCM strategies: explore interleaving verification with resource-state growth or partial teleportations to detect faults earlier while limiting idle exposure.
- Leakage handling: quantify the impact of leakage (despite low measured rate) on verification efficacy; evaluate repeated leakage checks and their overhead/benefit.
- Robustness to drift: study day-to-day calibration drift and its effect on the MCM advantage and ML stabilizer recommendations; assess stability of chosen schedules over time.
- End-to-end pipeline for large candidate spaces: provide a scalable procedure combining ML filtering, tabu/greedy search, and limited hardware validation to navigate ~106–109 stabilizer candidates efficiently.
- Integration with QEC: investigate how CliNR-based verification composes with small-distance error-correcting codes (distance ≥ 3) and whether verified teleportations can reduce logical error rates or syndrome-load in early-QEC regimes.
- Generality beyond the [[6,3,2]] GSE block: demonstrate the method on different encodings (e.g., Bravyi–Kitaev, larger GSE graphs) and on a diversity of Pauli-string structures to validate portability.
Practical Applications
Overview
Below are actionable, real-world applications that follow from the paper’s findings and methods—combining GSE-encoded Hamiltonian simulation, Clifford Noise Reduction (CliNR), Shor-style stabilizer verification, graph-state recompilation, mid-circuit measurement (MCM), and ML-guided stabilizer selection. Each item notes target sectors, potential tools/products/workflows, and key assumptions or dependencies that affect feasibility.
Immediate Applications
- Mid-circuit-verified Trotter blocks for near-term chemistry and materials demos (Industry: healthcare/pharma, materials, energy)
- What: Deploy CliNR+GSE-compiled, single/few-step Trotter blocks on dynamic-circuit trapped-ion QPUs to reduce logical error in encoded Hamiltonian evolution (demonstrated up to 54% lower error vs direct execution), enabling more reliable proof-of-concept dynamics on small systems.
- Tools/Workflows:
- “Verified Trotter” circuit templates with Shor-style stabilizer readout and postselection
- Dynamic-circuit scheduling with ancilla measure–reset–reuse
- Acceptance-rate dashboards tied to TVD and error breakdowns
- Assumptions/Dependencies:
- Hardware supports low-latency mid-circuit measurement and reset with low readout error and leakage
- Target step is Clifford (e.g., π/2 rotations) or can be decomposed to Clifford-dominant subcircuits
- Overhead (extra qubits, gates) fits device coherence and qubit budgets
- Device-matched compilation pipelines for trapped-ion hardware (Industry: quantum hardware/software)
- What: Use graph-state recompilation and local complementation to match resource-state preparation to native ZZ entangling gates; combine with symplectic-transvection-based Trotter synthesis to preserve encoded structure.
- Tools/Workflows:
- Graph-state recompiler modules that minimize CZ/ZZ complexity
- Symplectic-transvection synthesis integrated into compilers
- Assumptions/Dependencies:
- Access to device-specific native gate sets and calibrated pairwise fidelities
- Near–all-to–all or flexible entangling connectivity
- ML-guided stabilizer selection to cut verification cost (Industry/Academia: quantum software/ML)
- What: Train surrogate models to rank high-value stabilizers for CliNR verification, reducing brute-force search and improving yield at fixed overhead.
- Tools/Workflows:
- Feature extraction from graph/stabilizer structure (e.g., adjacency matrices)
- Integration with tabu or heuristic search to prune candidate sets
- Assumptions/Dependencies:
- Availability of labeled performance data or on-the-fly evaluation for model training
- Transferability of learned policies across graph-state compilations and hardware regimes
- Runtime shot-filtering workflows for dynamic circuits (Industry: cloud quantum services)
- What: Production pipelines that reject faulty resource-state preparations mid-circuit and only teleport verified blocks, improving effective accuracy without full QEC.
- Tools/Workflows:
- Real-time feed-forward routing (teleportation corrections performed in post-processing or low-latency control)
- Scheduler support for measure–reset–reuse of ancillas plus leakage checks
- Assumptions/Dependencies:
- Classical control latency compatible with circuit timing
- Sufficient shot budgets to absorb postselection discard rates
- Calibrated stabilizer-simulation for pre-run performance estimates (Academia/Industry: software/HPC)
- What: Use cuStabilizer/Stim-based calibrated simulators for Clifford-only blocks to forecast yield vs. fidelity trade-offs and identify gaps in noise modeling (e.g., crosstalk revealed by MCM vs. end-of-circuit readout differences).
- Tools/Workflows:
- Device-level Pauli-channel models parameterized by DRB, T2*, SPAM, per-pair rates
- Model-fitting pipelines comparing hardware and simulator outcomes (TVD, bias decomposition)
- Assumptions/Dependencies:
- Availability of up-to-date, per-pair calibration data
- Acknowledged limitations of Pauli-only models (non-Pauli/crosstalk may dominate in some regimes)
- Benchmark suites emphasizing mid-circuit measurement utility (Academia/Hardware vendors)
- What: Standardized experiments that isolate MCM benefits (vs. end-of-circuit readout) for verified Clifford subcircuits within encoded Hamiltonian simulations.
- Tools/Workflows:
- TVD and bias-vs-subspace error breakdowns
- Breakeven plots (error vs. overhead; acceptance yield vs. logical error) for different stabilizer schedules
- Assumptions/Dependencies:
- Comparable mapping quality between narrow baselines and wider verified circuits (or carefully annotated asymmetries)
- Curriculum and training modules on dynamic-circuit error detection (Education/Daily life)
- What: Classroom labs using stabilizer simulators and small QPU runs to teach mid-circuit verification, cat-state Shor measurements, and postselection.
- Tools/Workflows:
- Open-source notebooks integrating Stim/cuStabilizer with dynamic-circuit examples
- Assumptions/Dependencies:
- Access to small dynamic-circuit QPUs or simulators
- Simplified noise models for pedagogy
- Procurement and funding guidance emphasizing dynamic-circuit readiness (Policy)
- What: Update evaluation criteria to prioritize mid-circuit measurement/reset fidelity, latency, and dynamic-circuit toolchain maturity for publicly funded programs.
- Tools/Workflows:
- Request-for-proposal (RFP) checklists featuring MCM benchmarks and dynamic-circuit SDK features
- Assumptions/Dependencies:
- Engagement from funding bodies and consensus on relevant metrics
Long-Term Applications
- Scalable, verified Hamiltonian simulation services (Industry: materials, energy, pharma)
- What: Multi-step encoded Trotter pipelines that periodically verify Clifford sub-blocks mid-circuit to limit error spread in larger simulations (transport, catalysis, battery materials, photochemical dynamics).
- Tools/Workflows:
- Automated insertion of verification rounds based on accumulated error and acceptance-yield models
- Hybrid strategies coupling verified Clifford blocks with error-mitigated non-Clifford rotations
- Assumptions/Dependencies:
- Increased qubit counts and coherence to absorb verification overhead
- Efficient handling of non-Clifford segments (e.g., tailored mitigation, small-angle approximations)
- Bridging to logical-level QEC with pre-verification of hook-prone blocks (Industry/Academia: hardware/software)
- What: Use CliNR-like pre-verification to reduce correlated errors (“hooks”) within QEC-protected computations, lowering logical error before or alongside full syndrome decoding.
- Tools/Workflows:
- Co-design of verification schedules with code cycles and decoder constraints
- Assumptions/Dependencies:
- Mature logical qubits with repetitive syndrome extraction
- Low-latency classical feedback and integrated control stacks
- Cross-platform dynamic-circuit primitives (Industry: superconducting, neutral-atom platforms)
- What: Adapt Shor-style ancilla-assisted stabilizer readout and mid-circuit verification to hardware beyond trapped ions, enabling broader adoption of encoding-native verification.
- Tools/Workflows:
- Platform-specific cat/flag ancilla factories
- Standardized dynamic-circuit IRs with measure–reset–feed-forward semantics
- Assumptions/Dependencies:
- Reliable MCM and reset on target platforms
- Manageable crosstalk and measurement back-action
- Auto-tuning compilers for encoding, graph-state form, and verification schedules (Industry/Academia: software/ML)
- What: End-to-end optimizers that choose between encodings (e.g., GSE vs. alternatives), graph-state realizations, and stabilizer sets based on device telemetry and learned cost models.
- Tools/Workflows:
- Closed-loop ML that ingests calibration data, acceptance yields, and error metrics
- Multi-objective optimization (fidelity, depth, width, acceptance rate)
- Assumptions/Dependencies:
- Stable telemetry interfaces and data availability from QPUs
- Sufficient training data diversity to generalize across devices
- Verified resource-state “Clifford-as-a-service” offerings (Industry: cloud quantum)
- What: Cloud APIs that deliver pre-verified Clifford blocks teleported onto user data, abstracting verification internals and exposing acceptance/fidelity SLAs.
- Tools/Workflows:
- Resource-state factories with parallelized verification lanes
- Contracted QoS around acceptance rates and logical error
- Assumptions/Dependencies:
- Economies of scale for verification overhead
- Predictable queueing and latency for feed-forward
- Digital twins and advanced noise models driven by MCM-vs-ECM discrepancies (Industry/Academia: hardware modeling)
- What: Use observed performance gaps between mid-circuit and end-of-circuit readout to identify and parameterize non-Pauli mechanisms (e.g., crosstalk, leakage pathways), improving predictive models.
- Tools/Workflows:
- Expanded simulator backends capturing correlated/crosstalk errors and non-Markovian effects
- Assumptions/Dependencies:
- Rich diagnostic datasets and willingness to expose hardware internals for modeling
- Extending encoding-native verification beyond simulation (Industry/Academia: algorithms)
- What: Apply verified Clifford subcircuits in broader algorithms (e.g., QAOA mixers, phase estimation unitaries, state preparation blocks) to curb error propagation.
- Tools/Workflows:
- Libraries of verified building blocks with device-aware compilation
- Assumptions/Dependencies:
- Significant Clifford content in target algorithms
- Compatibility with dynamic-circuit execution constraints
- Standards for dynamic-circuit benchmarking and reporting (Policy/Industry consortia)
- What: Establish community benchmarks and reporting formats for MCM fidelity, reset performance, acceptance/yield curves, and verification-overhead accounting.
- Tools/Workflows:
- Open datasets and reference circuits spanning encodings and hardware types
- Assumptions/Dependencies:
- Cross-vendor collaboration and governance frameworks
- Regulated-workflow readiness in R&D (Industry: pharma/chem under GxP)
- What: Verified computation audit trails (accept/reject logs, stabilizer records) that support traceability in regulated research pipelines as quantum computing matures.
- Tools/Workflows:
- Compliance-friendly logging and reproducibility tooling for dynamic circuits
- Assumptions/Dependencies:
- Recognition of quantum-specific controls by regulatory bodies
- Mature pipeline integration with LIMS/ELN systems
- Public-facing education and workforce development at scale (Education/Daily life)
- What: Scalable coursework and training on dynamic circuits, verification, and encoded simulation, leveraging efficient stabilizer simulation and small-QPU access.
- Tools/Workflows:
- MOOC modules, remote labs with dynamic-circuit backends
- Assumptions/Dependencies:
- Sustained access to educational QPUs and simulator credits
- Up-to-date, open teaching materials
Notes on feasibility across applications:
- The observed gains depend critically on mid-circuit measurement quality and timing; advantages diminish when verification readout is deferred.
- Verified workflows introduce additional width/depth and postselection overhead; benefits hinge on hardware operating in a regime where verification catches faults before they spread more than it introduces new ones.
- The demonstrated improvements are for Clifford Trotter steps; extending to general (non-Clifford) evolutions requires hybrid strategies or different verification primitives.
- Real hardware showed features not captured by Pauli-only models, implying that platform-specific modeling and co-design remain essential.
Glossary
- Ancilla-assisted parity checks: Multi-qubit parity measurements performed using helper qubits to limit fault propagation during stabilizer readout. Example: "ancilla-assisted parity checks designed to limit additional error propagation"
- Barium development system: A trapped-ion hardware platform based on barium ions used to execute dynamic-circuit experiments. Example: "a Barium development system similar to the forthcoming IonQ Tempo line"
- Bell+Clifford resource state: A specially prepared entangled state combining Bell pairs with a Clifford circuit, verified and then used to teleport a target Clifford onto data. Example: "we prepare the corresponding Bell+Clifford resource state"
- Bravyi–Kitaev: A fermion-to-qubit encoding that balances operator locality and parity locality compared to Jordan–Wigner. Example: "Bravyi--Kitaev"
- Cat states: Multi-qubit entangled states (GHZ-like) used to fault-tolerantly extract stabilizer parities. Example: "verified cat states"
- Clifford Noise Reduction (CliNR): A verification and teleportation protocol that reduces errors in Clifford subcircuits by off-data stabilizer checks. Example: "Clifford Noise Reduction (CliNR)"
- CNOT ladder: A structured sequence of CNOTs used to implement products of Pauli operators (e.g., in Trotter circuits). Example: "CNOT ladder construction"
- Crosstalk: Undesired interactions between qubits or operations that induce correlated errors. Example: "leakage, crosstalk, and readout error"
- CZ-type entangling operations: Controlled-phase style entangling gates used in graph-state preparation via local-Clifford transformations. Example: "CZ-type entangling operations"
- Direct randomized benchmarking: A benchmarking protocol to estimate gate fidelities directly on specific qubit pairs. Example: "direct randomized benchmarking fidelities"
- Dynamic-circuit primitives: Capabilities like mid-circuit measurement and reset that enable in-circuit verification and feedback. Example: "dynamic-circuit primitives such as mid-circuit measurement"
- Even-occupation sector: The subspace of fermionic configurations with an even number of occupied modes. Example: "even-occupation sector of three fermions"
- Fermionic Hamiltonians: Hamiltonians describing systems of fermions; their qubit encodings often yield sums of Pauli strings. Example: "Quantum simulation of fermionic Hamiltonians"
- Flag‑qubit schemes: Low-ancilla methods where special “flag” qubits detect error propagation during stabilizer measurement. Example: "flag-qubit schemes"
- Generalized Superfast Encoding (GSE): A local fermion-to-qubit mapping whose graph structure yields low-weight operators and native stabilizers. Example: "Generalized Superfast Encoding (GSE)"
- Gottesman–Knill theorem: A result enabling efficient classical simulation of Clifford circuits via stabilizer formalism. Example: "via the Gottesman--Knill theorem"
- Graph state: A stabilizer state associated with a graph, prepared by entangling along edges and applying local Cliffords. Example: "local-Clifford-equivalent graph states"
- Graph-state recompilation: Rewriting a resource state as a graph state to better match a device’s native entangling gates. Example: "graph-state recompilation tailored to the trapped-ion native entangling gate"
- Hamiltonian simulation: Emulating time evolution under a target Hamiltonian using quantum circuits (e.g., Trotter methods). Example: "Hamiltonian simulation"
- Hook errors: Correlated errors created when ancilla faults or two-qubit gate sequences spread to multiple data qubits. Example: "suppressing hook errors generated by two-qubit gate sequences"
- Idle dephasing: Phase errors accumulated by qubits while waiting between operations. Example: "Idle dephasing."
- Jordan–Wigner strings: Nonlocal parity strings arising in the Jordan–Wigner fermion-to-qubit mapping. Example: "Jordan--Wigner strings"
- Leakage check: A measurement to detect population leaving the computational subspace (e.g., non-qubit levels). Example: "Each mid-circuit measurement is paired with a leakage check."
- Lie–Trotter approximation: A first-order product formula approximating e{-iHt} by sequential exponentials of summands. Example: "first-order Lie--Trotter approximation"
- Local complementation: A graph operation corresponding to local Clifford transformations, used to navigate equivalent graph-state realizations. Example: "local complementation"
- Majorana operators: Operators representing fermionic modes that aid in constructing local encodings and stabilizers. Example: "local Majorana operators"
- Mid-circuit measurement (MCM): Measuring qubits during the circuit to enable verification, resets, and conditional logic. Example: "mid-circuit measurement"
- Pauli channels: Noise models that apply random Pauli errors with specified probabilities. Example: "consists of four Pauli channels"
- Pauli feed-forward correction: Classically conditioned Pauli updates applied after Bell measurements in teleportation-based circuits. Example: "The Pauli feed-forward correction is"
- Pauli string: A tensor product of single-qubit Pauli operators representing a term in a qubit Hamiltonian. Example: "each P_j is a Pauli string"
- Probabilistic error cancellation: An error mitigation technique that inverts noise stochastically using quasiprobability sampling. Example: "probabilistic error cancellation"
- Product-formula methods: Trotter–Suzuki approaches that approximate evolution by ordered products of simpler exponentials. Example: "Product-formula methods remain attractive"
- Quantum error correction (QEC): Encoding and repeated syndrome extraction to detect/correct errors and preserve logical states. Example: "Quantum error correction (QEC)"
- Shor-style stabilizer readout: Ancilla-based parity extraction (often using cat states) designed to confine error propagation. Example: "Shor-style stabilizer readout"
- Stabilizer code: A code defined by commuting parity checks whose +1 eigenspace encodes logical information. Example: "In stabilizer codes,"
- Stabilizer group: The Abelian group generated by a set of stabilizers that fixes the code (or resource) state. Example: "stabilizer group"
- Stabilizer state: A quantum state uniquely specified as the +1 eigenstate of a set of commuting Pauli operators. Example: "stabilizer state"
- Steane-style extraction: Syndrome readout using encoded ancillas (Steane states) to reduce correlated error propagation. Example: "Steane-style extraction"
- Symmetry-based postselection: Discarding outcomes that violate conserved symmetries to mitigate errors. Example: "symmetry-based postselection"
- Symplectic transvections: Elementary symplectic operations used to synthesize Clifford/Trotter circuits in the binary formalism. Example: "symplectic transvections"
- Syndrome extraction: Measuring stabilizers to obtain error information without collapsing the logical state. Example: "syndrome extraction"
- Teleportation (gate teleportation): Using entanglement and measurement to apply a gate to data by teleporting through a resource. Example: "teleports the verified operation onto the computation"
- Total variation distance (TVD): A metric for distributional error, measuring the L1 distance between observed and ideal outputs. Example: "total variation distance (TVD)"
- Trapped-ion quantum computing: A platform using trapped ions with laser-driven gates and long coherence times. Example: "trapped-ion quantum computing"
- Trotter number: The number of product-formula repetitions used to approximate time evolution. Example: "Trotter number"
- Trotter step: One repetition of the ordered product implementing a short-time slice of evolution. Example: "Trotter step"
- Trotterized Hamiltonian simulation: Implementing time evolution via a sequence of product-formula steps. Example: "Trotterized Hamiltonian simulation"
- Virtual Z rotations: Phase updates implemented in software (frame changes) with effectively no physical error cost. Example: "Virtual rotations ()"
- Zero-noise extrapolation: An error mitigation technique that fits results at scaled noise levels and extrapolates to zero noise. Example: "zero-noise extrapolation"
- ZZ gate: A native two-qubit entangling operation generated by a ZZ interaction. Example: "ZZ gates"
Collections
Sign up for free to add this paper to one or more collections.