On the solution of trivalent decision problems by quantum state identification
arXiv:0707.1257 · doi:10.1007/s11047-009-9112-5
Abstract
The trivalent functions of a trit can be grouped into equipartitions of three elements. We discuss the separation of the corresponding functional classes by quantum state identifications.
References in corpus (11)
- Strengths and Weaknesses of Quantum Computing
- Quantum Algorithms Revisited
- Operationally Invariant Information in Quantum Measurements
- A Limit on the Speed of Quantum Computation in Determining Parity
- An Introduction to Quantum Complexity Theory
- From Cbits to Qbits: Teaching computer scientists quantum mechanics
- Quantum information in base n defined by state partitions
- Finding a state in a haystack
- Systematic Analysis of Majorization in Quantum Algorithms
- A polynomial-time solution to the parity problem on an NMR quantum computer
- Characterization of quantum computable decision problems by state discrimination