Abstract
Holographic circuits are defined here to be circuits in which information is represented as linear superpositions. Holographic circuits when suitably formulated can be emulated on classical computers in polynomial time. The questions we investigate are those of characterizing the complexity classes of computations that can be expressed by holographic circuits.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barenco, A., et al.: Elementary gates for quantum computation. Phys. Rev. A52, 3457 (1995)
Bubley, R., Dyer, M.: Graph orientations with no sink and an approximation for a hard case of #SAT. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana a, January 5-7, pp. 248–257 (1997)
Bremmer, M.J., Dawson, C.M., Dodd, J.L., Gilchrist, A., Harrow, A.W., Mortimer, D., Nielsen, M.A., Osborne, T.J.: A Practical scheme for quantum computation with any two-qubit entangling gate. Phys. Rev. Lett. 89, 247902 (2002)
Brualdi, R.A., Ryser, H.J.: Combinatorial Matrix Theory. Cambridge University Press, Cambridge (1991)
Brylinski, J.L., Brylinski, R.: Universal quantum gates. In: Brylinski, R., Chen, G. (eds.) Mathematics of Quantum Computation. Chapman & Hall/CRC Press, Boca Raton (2002)
Chuang, B.A., Nielsen, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2001)
Echternach, P., et al.: Universal quantum gates for single Cooper pair box bases quantum computing, Quantum Information and Computation, 143–150 (Also quant-ph/0112025.) (2001)
Gallbiati, G., Maftioli, F.: Discrete Applied Math. 51, 269–275 (1994)
Greuel, G.-M., Pfister, G., Schönemann, H.: Singular 2.0: A Computer Algebra System for Polynomial Computations. Centre for Computer Algebra, University of Kaiserslautern (2001)
Hunt III, H.B., Stearns, R.E.: The complexity of very simple boolean formulas with applications. SIAM J. Comput. 19(1), 44–70 (1990)
Lax, P.D.: Linear Algebra. Wiley, New York (1997)
Murota, K.: Matrices and Matroids for Systems Analysis. Springer, Berlin (2000)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1995)
Valiant, L.G.: Quantum circuits that can be simulated classically in polynomial time. SIAM J. on Computing 31(4), 1229–1254 (2002)
Valiant, L.G.: Expressiveness of matchgates. Theoretical Computer Science 289(1), 457–471 (2002)
Valiant, L.G.: Holographic algorithms. In: Proc. 45th Annual IEEE Symp. on Foundations of Computer Science, pp. 306–315. IEEE Press, Los Alamitos (2004)
Valiant, L.G.: Completeness for parity problems (2005) (manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valiant, L.G. (2005). Holographic Circuits. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_1
Download citation
DOI: https://doi.org/10.1007/11523468_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)