Bounded definition
The cited KLM construction shows that universal quantum computation is formally possible with linear optical components plus measurement-induced operations and resources. Within this page, that proposition is limited to The models, apparatus, protocols, datasets, and comparisons reported in A scheme for efficient quantum computation with linear optics.
Definition and evidence boundary
A computation model built from single photons, linear optics, photodetection, ancillas, measurement, and feed-forward. The bounded proposition retained by the canonical record is: The cited KLM construction shows that universal quantum computation is formally possible with linear optical components plus measurement-induced operations and resources.
The applicable scope is The models, apparatus, protocols, datasets, and comparisons reported in A scheme for efficient quantum computation with linear optics. This definition must not be generalized beyond the cited source and exact record boundary.
Claims: urn:maha:claim:linear-optical-quantum-computation
Mechanism and technical context
The paper constructs a universal quantum-computation scheme using single-photon sources, linear optical elements, photodetectors, feed-forward, and ancilla resources. This is the source-bound technical context for the record; no uncited mechanism is added by the compiler.
Formal universality does not establish practical source efficiency, detector performance, loss tolerance, or resource cost. The mechanism or method is therefore presented as one component of a larger system, not as evidence for every downstream outcome.
Claims: urn:maha:claim:linear-optical-quantum-computation
How to interpret the evidence
No platform-independent uncertainty interval exists; numerical values remain attached to the source experiment or model and its stated assumptions. The evidence maturity recorded here is single study, and the claim kind is theoretical model.
This candidate records one bounded source package. Independent replications and contradictory measurements must be compiled as separate records before maturity is upgraded. A formal scheme does not establish deterministic component performance, integrated manufacturability, loss tolerance at scale, or economic utility. These qualifications travel with the claim whenever it is reused.
Claims: urn:maha:claim:linear-optical-quantum-computation
What the source supports and what remains unknown
The inspected source supports exactly this: The paper constructs a universal quantum-computation scheme using single-photon sources, linear optical elements, photodetectors, feed-forward, and ancilla resources. It was read at Abstract; main construction; resource and error discussion.
What remains unknown is everything outside that locator. Formal universality does not establish practical source efficiency, detector performance, loss tolerance, or resource cost. No quantity, comparison, or downstream outcome is established here unless a separately scoped record measures it.
Claims: urn:maha:claim:linear-optical-quantum-computation
Source identity, locator, and reuse boundary
The bound source is “A scheme for efficient quantum computation with linear optics” by E. Knill, R. Laflamme, G. J. Milburn, published by Nature on 2001-01-04; its declared stable identity is doi:10.1038/35051009.
The inspected-content locator is Abstract; main construction; resource and error discussion. Reuse is limited to citation-with-paraphrase. Maha paraphrases the source-level result and links to the version of record; no article passage is reproduced. This metadata establishes source identity and inspection scope, not the truth of claims outside the cited locator.
Claims: urn:maha:claim:linear-optical-quantum-computation
Comparison and calculation boundary
Applicability is decided explicitly, not filled with generic material.
This record carries 1 source-bound proposition and therefore has no second supported side. A comparison would have to be manufactured from an adjacent title rather than from a second inspected claim, which the gate forbids.
The canonical claim declares no reproducible numerical inputs, equation, units, or uncertainty propagation; recorded uncertainty kind is qualitative. Supplying sample values would invent an unsupported quantitative result.
Limitations and prohibited inference
The claim stops where its evidence stops.
- record boundary
Formal universality does not establish practical source efficiency, detector performance, loss tolerance, or resource cost.
- record boundary
A source-bounded mechanism, method, or measurement record does not establish manufacturing yield, economic advantage, safety, clinical benefit, or commercial readiness unless those outcomes are measured in a separately scoped record.
- prohibited inference
Do not infer general quantum-computing readiness from the linear-optical quantum computation record alone.
- prohibited inference
Do not transfer a reported result across hardware, organisms, protocols, datasets, operating conditions, or outcome definitions without a declared comparison contract.
- editorial
This compilation reorganizes an existing inspected claim and its declared source; it does not add a new experiment, measurement, or independent replication.
- editorial
Internal editorial inspection is not external peer review, and no result on this page has been independently reproduced.
Related records and mathematical bridges
Typed links expose context without asserting equivalence.
Circuit quantum electrodynamics
Same canonical domain (quantum-systems). Domain membership only: no shared source or declared edge links these two records.
Selection: domain adjacency
Physical and logical qubits
Declared mechanistic-dependency edge from this record. The edge is navigational and asserts no equivalence or causation beyond the cited source scope.
Selection: bridge edge
When no declared bridge edge is present, related records are linked by shared evidence or canonical domain adjacency. Those links are navigational and do not claim mathematical or physical equivalence.
Connected domain graph
Typed dependencies preserve publication state.
Only independently canonical records receive public links and relation statements. Draft graph topology remains private.
Physical and logical qubits
outbound connection · comparison
Photonic encodings distinguish physical carriers from protected logical information.
Claim ledger
Every proposition keeps its own evidence state.
The cited KLM construction shows that universal quantum computation is formally possible with linear optical components plus measurement-induced operations and resources.
- Scope
- The models, apparatus, protocols, datasets, and comparisons reported in A scheme for efficient quantum computation with linear optics.
- Boundary
- Formal universality does not establish practical source efficiency, detector performance, loss tolerance, or resource cost.
- Uncertainty
- No platform-independent uncertainty interval exists; numerical values remain attached to the source experiment or model and its stated assumptions.
- Replication
- This candidate records one bounded source package. Independent replications and contradictory measurements must be compiled as separate records before maturity is upgraded.
Primary sources
Citation, locator, rights, and boundary travel together.
Source 1 · Nature
A scheme for efficient quantum computation with linear optics
E. Knill, R. Laflamme, G. J. Milburn
- Exact locator
- Abstract; main construction; resource and error discussion.
- Establishes
- The paper constructs a universal quantum-computation scheme using single-photon sources, linear optical elements, photodetectors, feed-forward, and ancilla resources.
- Boundary
- A formal scheme does not establish deterministic component performance, integrated manufacturability, loss tolerance at scale, or economic utility.
- Rights basis
- citation with paraphrase · Maha paraphrases the source-level result and links to the version of record; no article passage is reproduced.