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

Elsevier eBooks

The Two Routes to Quantum Mechanics

Günter Ludwig

Published Jan 1, 1968• 0 citations
Publisher
DOI
10.1016/b978-0-08-203204-5.50004-3

Related papers

The Road to Quantum Mechanics

Alberto G. Rojo, Anthony M. Bloch

Cambridge University Press eBooks•Apr 20, 2018•0 citations

Protocol for Routing Entanglement in the Quantum Ring Network

Masoumeh Shirichian, Sara Tofighi

The mechanism of transferring and routing information in quantum and classical network are basically different. The basic idea and working principle of quantum networks is based on a unique feature of quantum mechanics known as entanglement. Since entanglement generation rate is a key factor for quantum networks it can be considered as a route metric. In this paper, we propose two different protocols for local entanglement routing in a quantum ring network. In the first protocol, local link entanglement rate is considered as a route metric. However, the routing decision in the second protocol is made based on finding the shortest path between source and destination. It is shown that though local link entanglement rate is decisive criterion for routing in the first algorithm, the second algorithm can reach higher end-to-end entanglement rate.

International Symposium on Telecommunications•Dec 1, 2018•10 citations

Maximum Determinacy II: Quantum Theory

Justin Smith

This paper adds to the bound of Paper I its one non-classical premise: joins betweencells are dynamically real, so crossing one registers in a phase. With homogeneity the phaseof a closed route is eiκA, a unit-modulus character of the enclosed area, and on a compactarena with sharp records and a covariant seed κK = 2π with no free constant. A densitycannot carry the loop phase, so the content of an object carries phase: it is the route tallyfrom the last record, a sum over routes of their phases. Given two choice points per tick,normalisation by the route count, linearity and conservation of content, its evolution on thejoins is Feynman’s checkerboard in 1+1; the step is unitary, content is the Noether charge ofthe global phase, and the minimal carrier is C. Indistinguishable routes add, and the recordweight is quadratic, given transport invariance. A sharp record is a partition record, so thecontent ceiling ρ ≤ 1/K is a theorem; a record determines which cell the object is in, in bothmembers at once, and that is MD’s one departure from quantum mechanics, the statisticsof records being quantum mechanics’. Composites follow from the route tally on joint cells:the tensor product, local tomography and the effect set; exchange is restricted to bosons orfermions by two of the author’s rulings, the sign being a proposal. Under the route tallyprobability is conserved, a force gives Newton’s law, apertures give quantum mechanics’ farfield, and barriers its transmission. The 3+1 walk is in Paper IV. Every result carries itsgrade and premises; the premises are collected in Paper VI.

•Nov 9, 2026•0 citations

The way to quantum mechanics

三男 武谷, 正幸 長崎

WORLD SCIENTIFIC eBooks•Jan 1, 2001•0 citations

Three approaches to quantum mechanics

H.H. Rosenbrock

Physics Letters A•Feb 1, 1986•5 citations

Quantum communication for wireless wide-area networks

Sheng-Tzong Cheng, Chun-Yen Wang, Ming-Hon Tao

In this paper, a quantum routing mechanism is proposed to teleport a quantum state from one quantum device to another wirelessly even though these two devices do not share EPR pairs mutually. This results in the proposed quantum routing mechanism that can be used to construct the quantum wireless networks. In terms of time complexity, the proposed mechanism transports a quantum bit in time almost the same as the quantum teleportation does regardless of the number of hops between the source and destination. From this point of view, the quantum routing mechanism is close to optimal in data transmission time. In addition, in order to realize the wireless communication in the quantum domain, a hierarchical network architecture and its corresponding communication protocol are developed. Based on these network components, a scalable quantum wireless communication can be achieved.

IEEE Journal on Selected Areas in Communications•Jul 1, 2005•112 citations
The mechanism of transferring and routing information in quantum and classical network are basically different. The basic idea and working principle of quantum networks is based on a unique feature of quantum mechanics known as entanglement. Since entanglement generation rate is a key factor for quantum networks it can be considered as a route metric. In this paper, we propose two different protocols for local entanglement routing in a quantum ring network. In the first protocol, local link entanglement rate is considered as a route metric. However, the routing decision in the second protocol is made based on finding the shortest path between source and destination. It is shown that though local link entanglement rate is decisive criterion for routing in the first algorithm, the second algorithm can reach higher end-to-end entanglement rate.
This paper adds to the bound of Paper I its one non-classical premise: joins betweencells are dynamically real, so crossing one registers in a phase. With homogeneity the phaseof a closed route is eiκA, a unit-modulus character of the enclosed area, and on a compactarena with sharp records and a covariant seed κK = 2π with no free constant. A densitycannot carry the loop phase, so the content of an object carries phase: it is the route tallyfrom the last record, a sum over routes of their phases. Given two choice points per tick,normalisation by the route count, linearity and conservation of content, its evolution on thejoins is Feynman’s checkerboard in 1+1; the step is unitary, content is the Noether charge ofthe global phase, and the minimal carrier is C. Indistinguishable routes add, and the recordweight is quadratic, given transport invariance. A sharp record is a partition record, so thecontent ceiling ρ ≤ 1/K is a theorem; a record determines which cell the object is in, in bothmembers at once, and that is MD’s one departure from quantum mechanics, the statisticsof records being quantum mechanics’. Composites follow from the route tally on joint cells:the tensor product, local tomography and the effect set; exchange is restricted to bosons orfermions by two of the author’s rulings, the sign being a proposal. Under the route tallyprobability is conserved, a force gives Newton’s law, apertures give quantum mechanics’ farfield, and barriers its transmission. The 3+1 walk is in Paper IV. Every result carries itsgrade and premises; the premises are collected in Paper VI.
In this paper, a quantum routing mechanism is proposed to teleport a quantum state from one quantum device to another wirelessly even though these two devices do not share EPR pairs mutually. This results in the proposed quantum routing mechanism that can be used to construct the quantum wireless networks. In terms of time complexity, the proposed mechanism transports a quantum bit in time almost the same as the quantum teleportation does regardless of the number of hops between the source and destination. From this point of view, the quantum routing mechanism is close to optimal in data transmission time. In addition, in order to realize the wireless communication in the quantum domain, a hierarchical network architecture and its corresponding communication protocol are developed. Based on these network components, a scalable quantum wireless communication can be achieved.