Kochen-Specker Algorithms for Qubits (CROSBI ID 504056)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Pavičić, Mladen
engleski
Kochen-Specker Algorithms for Qubits
Algorithms for finding arbitrary sets of Kochen-Specker (KS) qubits as well as all the remaining vectors in a space of an arbitrary dimension are presented. The algorithms are based on linear MMP diagrams which generate orthogonalities of KS qubits, on an algebraic definition of states on the diagrams, and on nonlinear equations corresponding to MMP diagrams whose solutions are either KS qubits or the remaining vectors of a chosen space depending on whether the diagrams allow 0-1 states or not. The complexity of the algorithms is polynomial. New results obtained with the help of the algorithms are presented.
Kochen-Specker theorem; MMP diagrams; nonlinear equations; dispersion-free states; quantum experiments
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
195-198-x.
2004.
objavljeno
Podaci o matičnoj publikaciji
Quantum Communication, Measurement and Computing ; The Seventh International Conference on Quantum Communication, Measurement and Computing held in Glasgow, United Kingdom, 25-29 July 2004
Stephen M. Barnett, Erika Andersson, John Jeffers, Patrik Oehberg, and Osamu Hirota
Melville (NY): American Institute of Physics (AIP)
Podaci o skupu
The Seventh International Conference on Quantum Communication, Measurement and Computing
poster
25.07.2004-29.07.2004
Glasgow, Ujedinjeno Kraljevstvo