Classical programmability is enough for quantum circuits universality in approximate sense

Abstract

It was shown by M.A. Nielsen and I.L. Chuang 1997, that it is impossible to build strictly universal programmable quantum gate array, that could perform any unitary operation precisely and it was suggested to use probabilistic gate arrays instead. In present work is shown, that if to use more physical and weak condition of universality (suggested already in earliest work by D.Deutsch 1985) and to talk about simulation with arbitrary, but finite precision, then it is possible to build universal programmable gate array. But now the same no-go theorem by Nielsen and Chuang will have new interesting consequence --- controlling programs for the gate arrays can be considered as pure classical. More detailed design of such deterministic quantum gate arrays universal ``in approximate sense'' is considered in the paper.

5 pages, LaTeX, Extended abstract

References in corpus (7)

• Elementary gates for quantum computation
• Two-Bit Gates are Universal for Quantum Computation
• Conditional Quantum Dynamics and Logic Gates
• Programmable quantum gate arrays
• Storing quantum dynamics in quantum states: stochastic programmable gate for U(1) operations
• An Introduction to Quantum Complexity Theory
• Clifford algebras and universal sets of quantum gates

Cited by in corpus (7)

• Programmable Quantum Networks with Pure States
• Quantum Processors and Controllers
• Programmable Quantum State Transfer
• ALEPH-QP: Universal hybrid quantum processors
• Von Neumann Quantum Processors
• Universal quantum processors with arbitrary radix n
• Clifford algebras, noncommutative tori and universal quantum computers