Quantum Computation Beyond the "Standard Circuit Model

arXiv: Quantum Physics, 2017

In this paper we present a method for minimizing reversible quantum circuits using the Quantum Operator Form (QOF); a new representation of quantum circuit and of quantum-realized reversible circuits based on the CNOT, CV and CV$^\dagger$ quantum gates. The proposed form is a quantum extension to the well known Reed-Muller but unlike the Reed-Muller form, the QOF allows the usage of different quantum gates. Therefore QOF permits minimization of quantum circuits by using properties of different gates than only the multi-control Toffoli gates. We introduce a set of minimization rules and a pseudo-algorithm that can be used to design circuits with the CNOT, CV and CV$^\dagger$ quantum gates. We show how the QOF can be used to minimize reversible quantum circuits and how the rules allow to obtain exact realizations using the above mentioned quantum gates.

Electronic Notes in Theoretical Computer Science, 2006

It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-controlled Quantum Turing Machine (CQTM) which is a Turing machine with a quantum tape for acting on quantum data, and a classical transition function for a formalized classical control. In a CQTM, unitary transformations and quantum measurements are allowed. We show that any classical Turing machine is simulated by a CQTM without loss of efficiency. Furthermore, we show that any k-tape CQTM is simulated by a 2-tape CQTM with a quadratic loss of efficiency. In order to compare CQTMs to existing existing models of quantum computation, we prove that any uniform family of quantum circuits (A. C. Yao 1993) is efficiently approximated by a CQTM. Moreover we prove that any semi-uniform family of quantum circuits (H. Nishimura and M. Ozawa 2002), and any measurement calculus pattern (V. Danos, E. Kashefi, P. Panangaden 2004) are efficiently simulated by a CQTM. Finally, we introduce a Measurement-based Quantum Turing Machine (MQTM) which is a restriction of CQTMs where only projective measurements are allowed. We prove that any CQTM is efficiently simulated by a MQTM. In order to appreciate the similarity between programming classical Turing machines and programming CQTMs, some examples of CQTMs are given.

Physical Review A, 2004

From a geometric approach, we derive the minimum number of applications needed for an arbitrary Controlled-Unitary gate to construct a universal quantum circuit. A new analytic construction procedure is presented and shown to be either optimal or close to optimal. This result can be extended to improve the efficiency of universal quantum circuit construction from any entangling gate. Specifically, for both the Controlled-NOT and Double-CNOT gates, we develop simple analytic ways to construct universal quantum circuits with three applications, which is the least possible.

Physical Review A, 2009

We construct a universal quantum computer following Deutsch's original proposal of a universal quantum Turing machine ͑UQTM͒. Like Deutsch's UQTM, our machine can emulate any classical Turing machine and can execute any algorithm that can be implemented in the quantum gate array framework but under the control of a quantum program, and hence is universal. We present the architecture of the machine, which consists of a memory tape and a processor and describe the observables that comprise the registers of the processor and the instruction set, which includes a set of operations that can approximate any unitary operation to any desired accuracy and hence is quantum computationally universal. We present the unitary evolution operators that act on the machine to achieve universal computation and discuss each of them in detail and specify and discuss explicit program halting and concatenation schemes. We define and describe a set of primitive programs in order to demonstrate the universal nature of the machine. These primitive programs facilitate the implementation of more complex algorithms and we demonstrate their use by presenting a program that computes the NAND function, thereby also showing that the machine can compute any classically computable function.

Physical Review A, 2010

We apply quantum control techniques to control a large spin chain by only acting on two qubits at one of its ends, thereby implementing universal quantum computation by a combination of quantum gates on the latter and swap operations across the chain. It is shown that the control sequences can be computed and implemented efficiently. We discuss the application of these ideas to physical systems such as superconducting qubits in which full control of long chains is challenging. 02.30.Yy Controlling quantum systems at will has been an aspiration for physicists for a long time. Achieving quantum control not only clears the path towards a thorough understanding of quantum mechanics, but it also allows the exploration of novel devices whose functions are based on exotic quantum mechanical effects. Among others, the future success of quantum information processing depends largely on our ability to tame many-body quantum systems that are highly fragile. Although the progress of technology allows us to manipulate a small number of quanta quite well, controlling larger systems still represents a considerable challenge. Unless we overcome difficulties towards the control over large many-body systems, the benefits we can enjoy with the 'quantumness' will be severely limited.

Physical Review A, 1995

We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values (x, y) to (x, x ⊕ y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n )) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized Deutsch-Toffoli gates, that apply a specific U(2) transformation to one input bit if and only if the logical AND of all remaining input bits is satisfied. These gates play a central role in many proposed constructions of quantum computational networks. We derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two-and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number required for arbitrary n-bit unitary operations.

Physics of Particles and Nuclei Letters, 2009

One reason for this is the potential ability of a quantum computer to do certain computational tasks much more efficiently than they can be done by any classical computer Two the most famous examples of such calculations are Shor's algorithm for efficient factorization of large integers and Grover's algorithm of element search in an unsorted list.

The Journal of Chemical Physics, 2012

Unlike fixed designs, programmable circuit designs support an infinite number of operators. The functionality of a programmable circuit can be altered by simply changing the angle values of the rotation gates in the circuit. Here, we present a new quantum circuit design technique resulting in two general programmable circuit schemes. The circuit schemes can be used to simulate any given operator by setting the angle values in the circuit. This provides a fixed circuit design whose angles are determined from the elements of the given matrix-which can be non-unitary-in an efficient way. We also give both the classical and quantum complexity analysis for these circuits and show that the circuits require a few classical computations. They have almost the same quantum complexities as non-general circuits. Since the presented circuit designs are independent from the matrix decomposition techniques and the global optimization processes used to find quantum circuits for a given operator, high accuracy simulations can be done for the unitary propagators of molecular Hamiltonians on quantum computers. As an example, we show how to build the circuit design for the hydrogen molecule.

2014

Physics Letters A, 2012

A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g. in achieving the programmability of permutations of N different unitary channels with 1 use instead of N uses per channel. For this task, a new elemental resource is needed, the quantum switch, which can be programmed to switch the order of two channels with a single use of each one.