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

Operational Access Under One-Sided Control of a Two-Qubit Interaction

Dustin Ogle

Published Oct 14, 2026• 0 citations
Publisher

Abstract

Fix two qubits and one interaction, the controlled-NOT with control 𝑄2 and target 𝑄1. Give an experimenter local capabilities on one qubit only — resets, local unitaries, projective measurements with adaptive classical processing — and no operation on the other qubit except through the fixed gate. What can be detected about the two-qubit input? The accessible effects are derived from the declared operations and compared only afterwards with an algebra. Three results. (1) With capabilities on the target qubit, the span of accessible effects is exactly 𝒜1 = 𝑀2 ⊗ span{𝐼, 𝑍}, and every effect of 𝒜1 is the effect of one finite adaptive protocol: a non-classical algebra is accessible while the second qubit’s phase is not. (2) Restricting the local unitaries to {𝐼, 𝐻} leaves the span unchanged but strictly shrinks the set of implementable effects: two resource sets can distinguish exactly the same input pairs while differing in which exact measurements they can perform. (3) Relocating the capabilities to the control qubit gives span{𝐼, 𝑋} ⊗ 𝑀2; the two sites are exchanged by a symmetry of the gate, their access is incomparable, their common effects are those of an abelian algebra, and four distinctions are accessible from neither. The upper bounds are conserved-quantity arguments of the kind standard in quantum observability and indirect control; the exact effect-level statements are worked examples whose novelty is not claimed. Every identity and example is checked exactly in the accompanying scripts.

DOI
10.5281/zenodo.23353512

Related papers

Dynamical Stability of an Operational Access Boundary Under Local Free Evolution

Destinee Fogle

An earlier note derived, for two qubits coupled by a fixed controlled-NOT and an experimenterwith local capabilities on the target qubit only, that the accessible effects are exactly those of thealgebra A1 = M2 ⊗ span{I, Z}: a non-classical algebra is accessible while the control qubit’s phaseis not. That boundary was derived for a remainder with no dynamics of its own. This note askswhether it is maintained when the remainder evolves freely under a time-independent HamiltonianH = h1 X + h2 Y + h3 Z that is fixed and known, and the experimenter may insert waits ofany chosen duration, adaptively, anywhere in a protocol. The answer is an exact dichotomy. Theaccessible effect set, and its span, remain unchanged under every finite adaptive protocol if andonly if [H, Z] = 0, i.e. h1 = h2 = 0: the remainder may precess about the axis the interaction reads.For every other member of the family the failure is demonstrated operationally — an explicit pairof states that no protocol without waits can distinguish, and the existing readout protocol with asingle wait of duration π/(4|h|) whose acceptance probabilities differ by 1 − n3^4 > 0, n = h/|h|.For the control H = X the accessible span becomes all of M4, by thirteen named protocols; whetherevery effect of M4 is then implementable is left open. Invariance of a protocol’s statistics underchanges of its wait durations is defined and reported separately from preservation of the accessibleset; in this family the two coincide, for a reason that is stated. The closed form of the wait, thecommutation criterion and the span bound are standard material; the contribution is the worked,exactly-verified criterion at both the effect and the span level. Nothing about robustness or genericHamiltonians is claimed. Technical note, not peer-reviewed. The deposit contains the note and areproducibility archive (one exact-arithmetic script with 34 checks, a failure-path harness, the runrecord and a checksum manifest).

•Oct 14, 2026•0 citations

From Bounded Access to Recoverable Relations

Dustin Ogle

A small quantum arrangement — a reader qubit Q₁ coupled to a remainder qubit Q₂ through one fixed gate, with declared operations on Q₁ only — has access to some distinctions of the remainder and not to others. This manuscript follows that arrangement through fourteen research units — thirteen with a model, exact proofs and an executable checker (with certified interval enclosures wherever a propagation is read), and one, the maintenance criterion, a definition with checked decision logic — and organizes what they establish around four distinctions. First, protecting an access restriction is different from preserving the distinctions a reader can use: a universal leakage bound and an exact one-gate value are proved; a reset-based maintenance pulse prolongs limited leakage at the price of previously accessible information, while a reversible pulse prolongs it and preserves the full declared input class. Second, meeting protection criteria does not identify a mechanism: a prepared finite clock-controller meets four declared criteria at four sizes, and so does a static field with the clock decoupled, and so does the clock's free mean field at the largest size. Third, restoring a supporting condition does not necessarily recover the capability: coupling alignment is shown to be a supporting condition of the capability, and a restoring process that improves alignment in six matched realizations meets the full restoration standard in one, misses it narrowly in one and fails in four, while useful access is preserved in none. Fourth, retaining a relation, delivering it to a reader and using it internally are different achievements, and a supplied design's advantage can reverse when its context changes without the comparison identifying the mechanism: a sector record restores access at three of four endpoints under an added permission; an internal coupling improves the primary endpoint without reaching the reference; a two-by-two of axis term and gating cell reverses both contrasts. Each result is stated with what it does not establish. No conclusion about self-maintenance, ownership or experience is drawn. The deposit is a technical manuscript, not peer-reviewed, that consolidates fourteen closed research notes and adds no theorem; the supporting proofs are in the notes. The package contains the manuscript (PDF and Markdown), the fourteen notes with two errata, every checker and its run record, the failure-path harness with its recorded outputs and a release adapter, the two earlier baseline notes, a claim-to-proof map, a correction ledger, a source lock and a manifest with the SHA-256 of every file. Every number printed in the manuscript was read by script from a packaged run record. Running checks/run_all.sh reproduces every checker's recorded summary line with the declared dependencies only (Python 3.11 or later; sympy 1.14, mpmath 1.3, numpy); the harness coverage, including the checkers it does not cover, is stated in §10 and Appendix A. Drafting and computation were AI-assisted under the author's direction. Archive SHA-256: 119d835b2d2e19463f3eb6478ea34ddbdf4deea220a5d6d6fe528dcf7061bedb.

•Oct 24, 2026•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

Measurement-Free Encoded-Qubit Control and a Two-Local Qutrit Obstruction in a Spin-2 AKLT Plaquette

Boris Batenin, Andrei Preece

Can an encoded quantum state be controlled continuously without repeated measurements to prevent leakage? This study gives a constructive answer for a four-spin-2 AKLT plaquette, where a three-dimensional singlet code sits inside a 625-dimensional physical Hilbert space. The result combines an exact restriction with a coherent control scheme: strictly leakage-free two-site Hamiltonians cannot provide universal control of the full encoded qutrit, yet two explicitly constructed interactions enable universal single-qubit control without intermediate measurements or postselection within a two-dimensional subspace. The classification begins with the complete physical leakage map for all six spin pairs and exchange polynomials through degree four. Exact rational calculations establish rank L = 6 and dim ker L = 18 for the 255 × 24 matrix. Despite this large family of leakage-cancelling combinations, every accessible logical Hamiltonian obeys [A, R] = 0, where R is a fixed geometric involution. Its two-dimensional and one-dimensional eigenspaces therefore remain separate, obstructing universal SU(3) control. The restriction extends to arbitrary anisotropic two-site Hamiltonians that preserve the code. Within the rotationally invariant pair-polynomial model, interactions confined to the four plaquette edges act only as logical scalars; noncommuting protected controls require at least three pair supports and polynomial degree three. The constructive solution uses quadratic and cubic exchange Hamiltonians acting simultaneously on three pairs, including a diagonal link. Their coefficients cancel physical leakage exactly, so QH₂P = QH₃P = 0 throughout the full system, with P projecting onto the code and Q onto its complement. Their logical generators satisfy Lie(iA, iB) ≅ u(2) ⊕ u(1), allowing arbitrary coherent qubit gates while preserving the code at every intermediate time. The manuscript supplies exact certificates and verification procedures, together with operator-norm and calibration-error bounds that make the engineering requirements explicit. The practical opportunity is to remove intermediate code-check measurements from this control scheme; demonstrating a hardware advantage requires calibrated simultaneous interactions, including the diagonal channel, and measured gate fidelity and latency.

•Oct 28, 2026•0 citations

Controlled Bidirectional Remote Implementation of Arbitrary Unknown Single-Qubit Operations via a High-Dimensional Quantum Channel

Miao Liu, Zhaoyuan Zhang, Peng Jia-yin +1 more

Consider two remote laboratories: Alice holds an unknown input |ξ⟩ and a private single-qubit unitary UA, while Bob holds |η⟩ and UB. We present an exact local-operations-and-classical-communication protocol that produces UB|ξ⟩ at Alice’s site and UA|η⟩ at Bob’s site only after the controller labels are released. A five-qubit channel first relocates the input states; operation delivery then uses a five-particle channel of local dimension d, a 2d-outcome nonsymmetric qubit–qudit measurement, and label-dependent inverse maps. We give the qutrit case explicitly and one correction formula for arbitrary d. A dual-layer construction lets Charlie authorize both directions, while David and Fiona authorize one direction each. In the ideal lossless model, all admissible branches have recovery maps and their probabilities sum to unity. The basic qutrit protocol uses ten entangled carriers and 13 fixed-length classical bits; the dual-layer protocol uses fourteen carriers and 19 bits. Thus, dimensional flexibility and direction-selective control are obtained at increased resource-protection and signaling costs. This is an exact theoretical remote-operation construction, not an experimentally mature or composably secure communication protocol.

Applied Sciences•Sep 14, 2026•0 citations

Teleportation of a programmable gate

Nada Ali, Mark Hillery

Alice and Bob each have a qubit, and they would like to perform a two-qubit gate on them with the assistance of Charlie. The action of this gate depends on a parameter, which either Charlie knows, will receive later as classical information, or is encoded in a program state. We discuss both the case in which Alice and Bob send Charlie their qubits, which he entangles with his state, and the case where Alice and Bob use teleportation to entangle their states with Charlie's state. All of these procedures depend on the ability of Alice and Bob to apply local correction operations that depend on the results of measurements that Charlie makes, and we discuss under what conditions such operations are possible.

quant-pharXiv:2610.09022•Oct 8, 2026•0 citations
Fix two qubits and one interaction, the controlled-NOT with control 𝑄2 and target 𝑄1. Give an experimenter local capabilities on one qubit only — resets, local unitaries, projective measurements with adaptive classical processing — and no operation on the other qubit except through the fixed gate. What can be detected about the two-qubit input? The accessible effects are derived from the declared operations and compared only afterwards with an algebra. Three results. (1) With capabilities on the target qubit, the span of accessible effects is exactly 𝒜1 = 𝑀2 ⊗ span{𝐼, 𝑍}, and every effect of 𝒜1 is the effect of one finite adaptive protocol: a non-classical algebra is accessible while the second qubit’s phase is not. (2) Restricting the local unitaries to {𝐼, 𝐻} leaves the span unchanged but strictly shrinks the set of implementable effects: two resource sets can distinguish exactly the same input pairs while differing in which exact measurements they can perform. (3) Relocating the capabilities to the control qubit gives span{𝐼, 𝑋} ⊗ 𝑀2; the two sites are exchanged by a symmetry of the gate, their access is incomparable, their common effects are those of an abelian algebra, and four distinctions are accessible from neither. The upper bounds are conserved-quantity arguments of the kind standard in quantum observability and indirect control; the exact effect-level statements are worked examples whose novelty is not claimed. Every identity and example is checked exactly in the accompanying scripts.
An earlier note derived, for two qubits coupled by a fixed controlled-NOT and an experimenterwith local capabilities on the target qubit only, that the accessible effects are exactly those of thealgebra A1 = M2 ⊗ span{I, Z}: a non-classical algebra is accessible while the control qubit’s phaseis not. That boundary was derived for a remainder with no dynamics of its own. This note askswhether it is maintained when the remainder evolves freely under a time-independent HamiltonianH = h1 X + h2 Y + h3 Z that is fixed and known, and the experimenter may insert waits ofany chosen duration, adaptively, anywhere in a protocol. The answer is an exact dichotomy. Theaccessible effect set, and its span, remain unchanged under every finite adaptive protocol if andonly if [H, Z] = 0, i.e. h1 = h2 = 0: the remainder may precess about the axis the interaction reads.For every other member of the family the failure is demonstrated operationally — an explicit pairof states that no protocol without waits can distinguish, and the existing readout protocol with asingle wait of duration π/(4|h|) whose acceptance probabilities differ by 1 − n3^4 > 0, n = h/|h|.For the control H = X the accessible span becomes all of M4, by thirteen named protocols; whetherevery effect of M4 is then implementable is left open. Invariance of a protocol’s statistics underchanges of its wait durations is defined and reported separately from preservation of the accessibleset; in this family the two coincide, for a reason that is stated. The closed form of the wait, thecommutation criterion and the span bound are standard material; the contribution is the worked,exactly-verified criterion at both the effect and the span level. Nothing about robustness or genericHamiltonians is claimed. Technical note, not peer-reviewed. The deposit contains the note and areproducibility archive (one exact-arithmetic script with 34 checks, a failure-path harness, the runrecord and a checksum manifest).
A small quantum arrangement — a reader qubit Q₁ coupled to a remainder qubit Q₂ through one fixed gate, with declared operations on Q₁ only — has access to some distinctions of the remainder and not to others. This manuscript follows that arrangement through fourteen research units — thirteen with a model, exact proofs and an executable checker (with certified interval enclosures wherever a propagation is read), and one, the maintenance criterion, a definition with checked decision logic — and organizes what they establish around four distinctions. First, protecting an access restriction is different from preserving the distinctions a reader can use: a universal leakage bound and an exact one-gate value are proved; a reset-based maintenance pulse prolongs limited leakage at the price of previously accessible information, while a reversible pulse prolongs it and preserves the full declared input class. Second, meeting protection criteria does not identify a mechanism: a prepared finite clock-controller meets four declared criteria at four sizes, and so does a static field with the clock decoupled, and so does the clock's free mean field at the largest size. Third, restoring a supporting condition does not necessarily recover the capability: coupling alignment is shown to be a supporting condition of the capability, and a restoring process that improves alignment in six matched realizations meets the full restoration standard in one, misses it narrowly in one and fails in four, while useful access is preserved in none. Fourth, retaining a relation, delivering it to a reader and using it internally are different achievements, and a supplied design's advantage can reverse when its context changes without the comparison identifying the mechanism: a sector record restores access at three of four endpoints under an added permission; an internal coupling improves the primary endpoint without reaching the reference; a two-by-two of axis term and gating cell reverses both contrasts. Each result is stated with what it does not establish. No conclusion about self-maintenance, ownership or experience is drawn. The deposit is a technical manuscript, not peer-reviewed, that consolidates fourteen closed research notes and adds no theorem; the supporting proofs are in the notes. The package contains the manuscript (PDF and Markdown), the fourteen notes with two errata, every checker and its run record, the failure-path harness with its recorded outputs and a release adapter, the two earlier baseline notes, a claim-to-proof map, a correction ledger, a source lock and a manifest with the SHA-256 of every file. Every number printed in the manuscript was read by script from a packaged run record. Running checks/run_all.sh reproduces every checker's recorded summary line with the declared dependencies only (Python 3.11 or later; sympy 1.14, mpmath 1.3, numpy); the harness coverage, including the checkers it does not cover, is stated in §10 and Appendix A. Drafting and computation were AI-assisted under the author's direction. Archive SHA-256: 119d835b2d2e19463f3eb6478ea34ddbdf4deea220a5d6d6fe528dcf7061bedb.
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.
Can an encoded quantum state be controlled continuously without repeated measurements to prevent leakage? This study gives a constructive answer for a four-spin-2 AKLT plaquette, where a three-dimensional singlet code sits inside a 625-dimensional physical Hilbert space. The result combines an exact restriction with a coherent control scheme: strictly leakage-free two-site Hamiltonians cannot provide universal control of the full encoded qutrit, yet two explicitly constructed interactions enable universal single-qubit control without intermediate measurements or postselection within a two-dimensional subspace. The classification begins with the complete physical leakage map for all six spin pairs and exchange polynomials through degree four. Exact rational calculations establish rank L = 6 and dim ker L = 18 for the 255 × 24 matrix. Despite this large family of leakage-cancelling combinations, every accessible logical Hamiltonian obeys [A, R] = 0, where R is a fixed geometric involution. Its two-dimensional and one-dimensional eigenspaces therefore remain separate, obstructing universal SU(3) control. The restriction extends to arbitrary anisotropic two-site Hamiltonians that preserve the code. Within the rotationally invariant pair-polynomial model, interactions confined to the four plaquette edges act only as logical scalars; noncommuting protected controls require at least three pair supports and polynomial degree three. The constructive solution uses quadratic and cubic exchange Hamiltonians acting simultaneously on three pairs, including a diagonal link. Their coefficients cancel physical leakage exactly, so QH₂P = QH₃P = 0 throughout the full system, with P projecting onto the code and Q onto its complement. Their logical generators satisfy Lie(iA, iB) ≅ u(2) ⊕ u(1), allowing arbitrary coherent qubit gates while preserving the code at every intermediate time. The manuscript supplies exact certificates and verification procedures, together with operator-norm and calibration-error bounds that make the engineering requirements explicit. The practical opportunity is to remove intermediate code-check measurements from this control scheme; demonstrating a hardware advantage requires calibrated simultaneous interactions, including the diagonal channel, and measured gate fidelity and latency.
Consider two remote laboratories: Alice holds an unknown input |ξ⟩ and a private single-qubit unitary UA, while Bob holds |η⟩ and UB. We present an exact local-operations-and-classical-communication protocol that produces UB|ξ⟩ at Alice’s site and UA|η⟩ at Bob’s site only after the controller labels are released. A five-qubit channel first relocates the input states; operation delivery then uses a five-particle channel of local dimension d, a 2d-outcome nonsymmetric qubit–qudit measurement, and label-dependent inverse maps. We give the qutrit case explicitly and one correction formula for arbitrary d. A dual-layer construction lets Charlie authorize both directions, while David and Fiona authorize one direction each. In the ideal lossless model, all admissible branches have recovery maps and their probabilities sum to unity. The basic qutrit protocol uses ten entangled carriers and 13 fixed-length classical bits; the dual-layer protocol uses fourteen carriers and 19 bits. Thus, dimensional flexibility and direction-selective control are obtained at increased resource-protection and signaling costs. This is an exact theoretical remote-operation construction, not an experimentally mature or composably secure communication protocol.
Alice and Bob each have a qubit, and they would like to perform a two-qubit gate on them with the assistance of Charlie. The action of this gate depends on a parameter, which either Charlie knows, will receive later as classical information, or is encoded in a program state. We discuss both the case in which Alice and Bob send Charlie their qubits, which he entangles with his state, and the case where Alice and Bob use teleportation to entangle their states with Charlie's state. All of these procedures depend on the ability of Alice and Bob to apply local correction operations that depend on the results of measurements that Charlie makes, and we discuss under what conditions such operations are possible.