Timeline of quantum computing and communication
Open-knowledge reference entry
This is a timeline of quantum computing and communication.
1930s
1936
Erwin Schrödinger publishes a theorem setting the basis for quantum steering and the limits of quantum state purification. The theorem remained uncredited even after multiple expansions and rediscoveries.
1960s
1968/69/70
Stephen Wiesner invents conjugate coding.
1969
13 June – James L. Park (Washington State University, Pullman)'s paper is received by Foundations of Physics, in which he describes the non-possibility of disturbance in a quantum transition state in the context of a disproof of quantum jumps in the Bohr model of the atom.
1970s
1973
Alexander Holevo's paper is published. The Holevo bound describes a limit of the quantity of classical information which is possible to quanta encode.
Charles H. Bennett shows that computation can be done reversibly.
1975
R. P. Poplavskii publishes "Thermodynamical models of information processing" (in Russian) which shows the computational infeasibility of simulating quantum systems on classical computers, due to the superposition principle.
Roman Stanisław Ingarden, a Polish mathematical physicist, submits the paper "Quantum Information Theory" in Reports on Mathematical Physics, vol.
The public source identifies “Timeline of quantum computing and communication” as open-knowledge reference entry. This brief keeps that definition visible, then builds a research path around Timeline, quantum and computing.
Why this record matters
A short description can identify a subject without explaining its stakes. For “Timeline of quantum computing and communication”, the useful work is to connect “open-knowledge reference entry” to the records capable of establishing context and consequence.
Named sources, stable identifiers and responsible institutions provide the strongest route from overview to verifiable evidence. The source revision retrieved here is dated Sep 8, 2026. The linked authority identifier is Q4302108. None of the 0 selected statements returned an explicit reference. The first chronological checks are 1936, 1968, 1969 and 1973.
Overview language is designed for orientation and should not be treated as a substitute for the evidence cited beneath it. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Timeline of quantum computing and communication”, its source revision and the description used here.
- Expand the search: follow Timeline of quantum computing and communication primary sources, Timeline of quantum computing and communication archive and Timeline research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Timeline of quantum computing and communication”?
- Which institution is responsible for the underlying evidence?
- What terminology or title could unlock a more precise catalogue search?
Search terms from this dossier
This entry incorporates text from “Timeline of quantum computing and communication” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.