Orthogonal vector computations
arXiv:1601.07106 · doi:10.3390/e18050156
Abstract
Quantum computation is the suitable orthogonal encoding of possibly holistic functional properties into state vectors, followed by a projective measurement.
arXiv comment8 pages, 2 figures, some revisions and additions
References in corpus (10)
- Strengths and Weaknesses of Quantum Computing
- A Limit on the Speed of Quantum Computation in Determining Parity
- A variant of the Kochen-Specker theorem localising value indefiniteness
- Logical equivalence between generalized urn models and finite automata
- Quantum information in base n defined by state partitions
- Finding a state in a haystack
- Quantum information via state partitions and the context translation principle
- Unscrambling the Quantum Omelette
- On the solution of trivalent decision problems by quantum state identification
- Quantum queries associated with equi-partitioning of states and multipartite relational encoding across space-time