Non-local quantum computation¶

A distributed quantum-computation model in which separated parties use pre-shared entanglement and a single simultaneous communication round to implement a joint operation on distributed inputs.

Version: v1 · 2026-09-08 · History
Domain-specific #: 5785
Origin domain: quantum information
Subdomain: distributed quantum computation

Core Idea¶

Non-local quantum computation implements a global quantum operation without sequential interaction after inputs arrive, using entanglement and one round of simultaneous communication.^[1] Parties encode local operations into measurements and entangled correlations, exchange classical or quantum messages once, then apply corrections producing the target joint output. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of quantum information. It is instantaneous-style distributed computation linking entanglement cost to circuit and communication complexity. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy. The evidential layer asks what observation or proof warrants the claim: type the carrier, state every parameter and convention in the definition, test that communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Non-local quantum computation, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

Structural Signature¶

Carrier: two or more separated parties, distributed quantum inputs, prior entangled resource, local quantum operations, one simultaneous message round, target channel or unitary and resource complexity
Inputs or antecedent state: the exact quantum information carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Non-local quantum computation
Constitutive operation: Parties encode local operations into measurements and entangled correlations, exchange classical or quantum messages once, then apply corrections producing the target joint output.
Invariant: communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy
Recognition test: type the carrier, state every parameter and convention in the definition, test that communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
Output or consequence: recognizing and comparing instances of Non-local quantum computation, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition that communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of quantum information. The field contains many questions and methods that do not instantiate Non-local quantum computation.
It is not its most familiar example. Two separated agents receive halves of an input state, perform local operations with shared entanglement and exchange one simultaneous message to realize a joint circuit. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Quantum communication complexity. Quantum communication complexity counts communication for distributed functions across general protocols; NLQC imposes a single simultaneous round and focuses on implementing a joint quantum operation.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Non-local quantum computation must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside quantum information, the vocabulary and validity conditions do not transfer literally.

Scope of Application¶

Non-local quantum computation belongs to quantum information and is useful where the analyst can specify two or more separated parties, distributed quantum inputs, prior entangled resource, local quantum operations, one simultaneous message round, target channel or unitary and resource complexity, then evaluate communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy. The scope is broad within that domain but bounded by the need for communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy. This is a high-level theoretical identity; it omits operational exploitation guidance for cryptographic or physical systems.^[2]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact quantum information carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Non-local quantum computation are converted, constrained, or organized by Parties encode local operations into measurements and entangled correlations, exchange classical or quantum messages once, then apply corrections producing the target joint output..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Non-local quantum computation must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Non-local quantum computation, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

Clarity¶

The abstraction clarifies a crowded vocabulary by making communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Non-local quantum computation can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact quantum information carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Non-local quantum computation, the structure counts as Non-local quantum computation exactly when communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Non-local quantum computation. Non-local quantum computation compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Non-local quantum computation. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: two or more separated parties, distributed quantum inputs, prior entangled resource, local quantum operations, one simultaneous message round, target channel or unitary and resource complexity. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
Derive consequences. From communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy, infer recognizing and comparing instances of Non-local quantum computation, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Non-local quantum computation must control the decision and an object that resembles Non-local quantum computation in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of quantum information because they reuse two or more separated parties, distributed quantum inputs, prior entangled resource, local quantum operations, one simultaneous message round, target channel or unitary and resource complexity, Parties encode local operations into measurements and entangled correlations, exchange classical or quantum messages once, then apply corrections producing the target joint output., and type the carrier, state every parameter and convention in the definition, test that communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from Two separated agents receive halves of an input state, perform local operations with shared entanglement and exchange one simultaneous message to realize a joint circuit. to A theoretical result states approximation error, allowed messages and entanglement scaling and separates the model from a deployable attack claim..^[3]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Non-local quantum computation, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

Two separated agents receive halves of an input state, perform local operations with shared entanglement and exchange one simultaneous message to realize a joint circuit. The example exposes the carrier and directly tests that communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is two or more separated parties, distributed quantum inputs, prior entangled resource, local quantum operations, one simultaneous message round, target channel or unitary and resource complexity; the operative rule is Parties encode local operations into measurements and entangled correlations, exchange classical or quantum messages once, then apply corrections producing the target joint output.; the invariant is communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy; and the result supports recognizing and comparing instances of Non-local quantum computation, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy destroys the classification.

Mapped back: two or more separated parties, distributed quantum inputs, prior entangled resource, local quantum operations, one simultaneous message round, target channel or unitary and resource complexity → Parties encode local operations into measurements and entangled correlations, exchange classical or quantum messages once, then apply corrections producing the target joint output. → communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy → recognizing and comparing instances of Non-local quantum computation, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

A theoretical result states approximation error, allowed messages and entanglement scaling and separates the model from a deployable attack claim. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—type the carrier, state every parameter and convention in the definition, test that communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases—can be run and because the same failure boundary—the carrier is mistyped, the condition that communication is restricted to the declared simultaneous round and resource accounting includes the pre-shared entanglement needed for the target accuracy fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[2] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Non-local quantum computation, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Non-local quantum computation, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from quantum information and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, Parties encode local operations into measurements and entangled correlations, exchange classical or quantum messages once, then apply corrections producing the target joint output., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Non-local quantum computation, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Non-local quantum computation, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in quantum information.

The proposed strict upward parent is prime:coordination. Separated parties coordinate a joint computation under severe communication timing constraints; entanglement resources supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Non-local quantum computation adds domain-specific constraints.

The entry does not collapse into that parent because instantaneous-style distributed computation linking entanglement cost to circuit and communication complexity It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Non-local quantum computation. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge.

The prospective workspace queue contains one strict upward edge to prime:coordination. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction Non-local quantum computation Domain-specific

Parents (1) — more general patterns this builds on

Non-local quantum computation is a kind of Coordination Prime

The proposed strict upward parent is prime:coordination.

Hierarchy paths (5) — routes to 4 parentless roots

Non-local quantum computation → Coordination → Concurrency

Show alternative paths (4)

Neighborhood in Abstraction Space¶

Non-local quantum computation sits in a crowded region of the domain-specific corpus (13^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Quantum Information & State Structure (41 abstractions)

Nearest neighbors

State-merging — 0.94
Superdense coding — 0.93
Greenberger–Horne–Zeilinger state — 0.92
Quantum cloning — 0.92
Incompatibility of quantum measurements — 0.92

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Quantum communication complexity. Quantum communication complexity counts communication for distributed functions across general protocols; NLQC imposes a single simultaneous round and focuses on implementing a joint quantum operation.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Non-local quantum computation. A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Non-local quantum computation. An extension qualifies only when its changed axioms and retained invariant are stated.

References¶

[1] Florian Speelman, 'Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits', Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.TQC.2016.9. registry ↩a ↩b

[2] Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman, 'The garden-hose model', ACM, 2013, doi:10.1145/2422436.2422453. registry ↩a ↩b

[3] Allerstorfer, Rene, Buhrman, Harry, May, Alex, Speelman, Florian, Verduyn Lunel, Philip, 'Relating non-local quantum computation to information theoretic cryptography', Quantum, 2024, doi:10.22331/q-2024-06-27-1387. registry ↩