Computational complexity and applications of quantum algorithm. (English)
Appl. Math. Comput. 218, No. 16, 8019-8028 (2012).
1
On quantum algorithm for exptime problem. (English)
Accardi, Luigi (ed.) et al., Quantum bio-informatics IV. From quantum information to bio-informatics, Tokyo, Japan, March 10‒13, 2010. Selected papers based on the presentations at the international conference. Hackensack, NJ: World Scientific (ISBN 978-981-4343-75-6/hbk; 978-981-4343-76-3/ebook). QP-PQ: Quantum Probability and White Noise Analysis 28, 173-183 (2011).
2
Quantum mutual entropy defined by liftings. (English)
Found. Phys. 41, No. 3, 406-413 (2011).
3
On generalized quantum Turing machine and its applications. (English)
Open Syst. Inf. Dyn. 16, No. 2-3, 195-204 (2009).
4
Note on a universal quantum Turing machine. (English)
Phys. Lett., A 372, No. 31, 5120-5122 (2008).
5
Language classes defined by generalized quantum Turing machine. (English)
Open Syst. Inf. Dyn. 15, No. 4, 383-396 (2008).
6
Review on quantum chaos algorithm and generalized quantum turing machine. (English)
Accardi, Luigi (ed.) et al., Quantum bio-informatics. From quantum information to bio-informatics (QBIC 2007), international conference, Tokyo, Japan, March 14‒17, 2007. Selected papers. Hackensack, NJ: World Scientific (ISBN 978-981-279-316-4/hbk). QP-PQ: Quantum Probability and White Noise Analysis 21, 126-141 (2008).
7
Rigorous estimation of computational complexity for OMV SAT algorithm. (English)
Open Syst. Inf. Dyn. 15, No. 2, 173-187 (2008).
8
On generalized quantum Turing machine and its application. (English)
Accardi, Luigi (ed.) et al., Quantum probability and infinite dimensional analysis. Proceedings of the 26th conference, Levico, Italy, 20‒26 February 2005. Hackensack, NJ: World Scientific (ISBN 978-981-270-851-9/hbk). QP-PQ: Quantum Probability and White Noise Analysis 20, 251-257 (2007).
9
Start
Contact
Print
General Help
