The Calculus of Effective Quantum Logic

Quantum Logic ◽  
1978 ◽  
pp. 72-98
Author(s):  
Peter Mittelstaedt
Keyword(s):  
Quantum Logic

Ternary quantum logic

2000 ◽  
Author(s):  
Normen Giesecke
Keyword(s):  
Quantum Logic

Turing Machines Based on Quantum Logic and Their Universality

2012 ◽  
Vol 35 (7) ◽  
pp. 1407 ◽  
Author(s):  
Yong-Ming LI ◽  
Ping LI
Keyword(s):  
Quantum Logic ◽  
Turing Machines

Quantum Logic, Conditional Probability, and Interference

1982 ◽  
Vol 49 (3) ◽  
pp. 402-421 ◽  
Author(s):  
Jeffrey Bub
Keyword(s):  
Quantum Logic ◽  
Conditional Probability

Quantum Logic

1974 ◽  
Vol 1974 ◽  
pp. 501-514
Author(s):  
Peter Mittelstaedt
Keyword(s):  
Quantum Logic

scholarly journals Publisher Correction: Integrated optical multi-ion quantum logic

Nature ◽  
2021 ◽  
Vol 590 (7844) ◽  
pp. E15-E15
Author(s):  
Karan K. Mehta ◽  
Chi Zhang ◽  
Maciej Malinowski ◽  
Thanh-Long Nguyen ◽  
Martin Stadler ◽  
...  
Keyword(s):  
Quantum Logic ◽  
Integrated Optical

scholarly journals MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES

2009 ◽  
Vol 07 (06) ◽  
pp. 1053-1203 ◽  
Author(s):  
ROBERT RAUßENDORF
Keyword(s):  
Computational Model ◽  
Quantum Computation ◽  
Quantum Logic ◽  
Network Model ◽  
Quantum Computer ◽  
Fault Tolerant ◽  
Cluster State ◽  
Building Blocks ◽  
Network Simulator ◽  
Classical Level

In this thesis, we describe the one-way quantum computer [Formula: see text], a scheme of universal quantum computation that consists entirely of one-qubit measurements on a highly entangled multiparticle state, i.e. the cluster state. We prove the universality of the [Formula: see text], describe the underlying computational model and demonstrate that the [Formula: see text] can be operated fault-tolerantly. In Sec. 2, we show that the [Formula: see text] can be regarded as a simulator of quantum logic networks. In this way, we prove the universality and establish the link to the network model — the common model of quantum computation. We also indicate that the description of the [Formula: see text] as a network simulator is not adequate in every respect. In Sec. 3, we derive the computational model underlying the [Formula: see text], which is very different from the quantum logic network model. The [Formula: see text] has no quantum input, no quantum output and no quantum register, and the unitary gates from some universal set are not the elementary building blocks of [Formula: see text] quantum algorithms. Further, all information that is processed with the [Formula: see text] is the outcomes of one-qubit measurements and thus processing of information exists only at the classical level. The [Formula: see text] is nevertheless quantum-mechanical, as it uses a highly entangled cluster state as the central physical resource. In Sec. 4, we show that there exist nonzero error thresholds for fault-tolerant quantum computation with the [Formula: see text]. Further, we outline the concept of checksums in the context of the [Formula: see text], which may become an element in future practical and adequate methods for fault-tolerant [Formula: see text] computation.

Sign in / Sign up

Export Citation Format

Share Document