Abstract
In this paper we show a computational aspect of the quantum hashing technique. In particular we apply it for computing Boolean functions in the model of read-once quantum branching programs based on the properties of specific polynomial presentation of those functions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ablayev, F.M., Vasiliev, A.V.: Cryptographic quantum hashing. Laser Physics Letters 11(2), 025202 (2014). http://stacks.iop.org/1612-202X/11/i=2/a=025202
Ablayev, F., Andrianov, S., Moiseev, S., Vasiliev, A.: Encoded universality of quantum computations on the multi-atomic ensembles in the qed cavity. Tech. Rep. arXiv:1109.0291 [quant-ph]. Cornell University Library (September 2011). http://arxiv.org/abs/1109.0291
Ablayev, F., Gainutdinova, A., Karpinski, M.: On Computational Power of Quantum Branching Programs. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 59–70. Springer, Heidelberg (2001)
Ablayev, F., Gainutdinova, A., Karpinski, M., Moore, C., Pollett, C.: On the computational power of probabilistic and quantum branching programs of constant width. Information and Computation 203, 145–162 (2005). http://dx.doi.org/10.1016/j.ic.2005.04.003
Ablayev, F., Vasiliev, A.: Algorithms for quantum branching programs based on fingerprinting. Electronic Proceedings in Theoretical Computer Science 9, 1–11 (2009). http://arxiv.org/abs/0911.2317
Ablayev, F., Andrianov, S., Moiseev, S., Vasiliev, A.: Quantum computer with atomic logical qubits encoded on macroscopic three-level systems in common quantum electrodynamic cavity. Lobachevskii Journal of Mathematics 34(4), 291–303 (2013). http://dx.doi.org/10.1134/S1995080213040094
Agrawal, V., Lee, D., Wozniakowski, H.: Numerical computation of characteristic polynomials of boolean functions and its applications. Numerical Algorithms 17, 261–278 (1998). http://dx.doi.org/10.1023/A:1016632423579
Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum fingerprinting. Phys. Rev. Lett. 87(16), 167902 (2001). www.arXiv.org/quant-ph/0102001v1
Deutsch, D.: Quantum computational networks. Royal Society of London Proceedings Series A 425, 73–90 (1989). http://dx.doi.org/10.1098/rspa.1989.0099
Gottesman, D., Chuang, I.: Quantum digital signatures. Tech. Rep. arXiv:quant-ph/0105032. Cornell University Library (November 2001). http://arxiv.org/abs/quant-ph/0105032
Jain, J., Abraham, J.A., Bitner, J., Fussell, D.S.: Probabilistic verification of boolean functions. Formal Methods in System Design 1, 61–115 (1992)
Nakanishi, M., Hamaguchi, K., Kashiwabara, T.: Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 467–476. Springer, Heidelberg (2000)
Razborov, A.A., Szemeredi, E., Wigderson, A.: Constructing small sets that are uniform in arithmetic progressions. Combinatorics, Probability & Computing 2, 513–518 (1993)
Sauerhoff, M., Sieling, D.: Quantum branching programs and space-bounded nonuniform quantum complexity. Theoretical Computer Science 334(1–3), 177–225 (2005). http://arxiv.org/abs/quant-ph/0403164
Wegener, I.: Branching Programs and Binary Decision Diagrams. SIAM Monographs on Discrete Mathematics and Applications. SIAM Press (2000)
de Wolf, R.: Quantum Computing and Communication Complexity. Ph.D. thesis, University of Amsterdam (2001)
Yao, A.C.C.: Quantum circuit complexity. In: Proceedings of Thirty-fourth IEEE Symposium on Foundations of Computer Science, pp. 352–361. IEEE Computer Society, Palo Alto (1993)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Ablayev, F., Vasiliev, A. (2014). Computing Boolean Functions via Quantum Hashing. In: Calude, C., Freivalds, R., Kazuo, I. (eds) Computing with New Resources. Lecture Notes in Computer Science(), vol 8808. Springer, Cham. https://doi.org/10.1007/978-3-319-13350-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-13350-8_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13349-2
Online ISBN: 978-3-319-13350-8
eBook Packages: Computer ScienceComputer Science (R0)