Quantum Computing and a Unified Approach to Fast Unitary Transforms
Sos S. Agaian, Andreas Klappenecker
备注：
11 pages, LaTeX2e, 15 figures, not viewable as dvi. To appear in Image Processing: Algorithms and Systems, Electronic Imaging 2002, San Jose, SPIE, 2002. Odd title beyond our control
A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum algorithms. We present a divide-and-conquer approach to the design of various quantum algorithms. The class of algorithm includes many transforms which are well-known in classical signal processing applications. We show how fast quantum algorithms can be derived for the discrete Fourier transform, the Walsh-Hadamard transform, the Slant transform, and the Hartley transform. All these algorithms use at most O(log^2 N) operations to transform a state vector of a quantum computer of length N.
Quantum computation is based on implementing selected unitary transformations which represent algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The approach is illustrated in the implementation of one and two qubits gates in model molecular systems.
For the past two decades, researchers have attempted to create a Quantum Neural Network (QNN) by combining the merits of quantum computing and neural computing. In order to exploit the advantages of the two prolific fields, the QNN must meet the non-trivial task of integrating the unitary dynamics of quantum computing and the dissipative dynamics of neural computing. At the core of quantum computing and neural computing lies the qubit and perceptron, respectively. We see that past implementations of the quantum perceptron model have failed to fuse the two elegantly. This was due to a slow lear…
There are major advantages in a newer version of Grover's quantum algorithm utilizing a general unitary transformation in the search of a single object in a large unsorted database. In this paper, we generalize this algorithm to multiobject search. We show the techniques to achieve the reduction of the problem to one on an invariant subspace of dimension just equal to two.
Quantum algorithms are typically understood in terms of the evolution of a multi-qubit quantum system under a prescribed sequence of unitary transformations. The input to the algorithm prescribes some of the unitary transformations in the sequence with others remaining fixed. For oracle query algorithms, the input determines the oracle unitary transformation. Such algorithms can be regarded as devices for discriminating amongst a set of unitary transformations. The question arises: "Given a set of known oracle unitary transformations, to what extent is it possible to discriminate amongst them?…
The equivalence of multipartite quantum mixed states under local unitary transformations is studied. A criterion for the equivalence of non-degenerate mixed multipartite quantum states under local unitary transformations is presented.
This paper initiates the study of hidden variables from the discrete, abstract perspective of quantum computing. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another, into a stochastic matrix that maps the initial probability distribution to the final one in some fixed basis. We list seven axioms that we might want such a theory to satisfy, and then investigate which of the axioms can be satisfied simultaneously. Toward this end, we construct a new hidden-variable theory that is both robust to small perturbations and indifferent to…
In the well known treatment of quantum teleportation, the receiver should convert the state of his EPR particle into the replica of the unknown quantum state by one of four possible unitary transformations. However, the importance of these unitary transformations must be emphasized. We will show in this paper that the receiver can not transform the state of his particle into an exact replica of the unknown state which the sender want to transfer if he have not a proper implementation of these unitary transformations. In the procedure of converting state, the inevitable coupling between EPR par…
In terms of the analysis of fixed point subgroup and tensor decomposability of certain matrices, we study the equivalence of of quantum bipartite mixed states under local unitary transformations. For non-degenerate case an operational criterion for the equivalence of two such mixed bipartite states under local unitary transformations is presented.
We propose a genetic-algorithm-based method to find the unitary transformations for any desired quantum computation. We formulate a simple genetic algorithm by introducing the "genetic parameter vector" of the unitary transformations to be found. In the genetic algorithm process, all components of the genetic parameter vectors are supposed to evolve to the solution parameters of the unitary transformations. We apply our method to find the optimal unitary transformations and to generalize the corresponding quantum algorithms for a realistic problem, the one-bit oracle decision problem, or the o…
Quantum computation and quantum control operate by building unitary transformations out of sequences of elementary quantum logic operations or applications of control fields. This paper puts upper bounds on the minimum time required to implement a desired unitary transformation on a d-dimensional Hilbert space when applying sequences of Hamiltonian transformations. We show that strategies of building up a desired unitary out of non-infinitesimal and infinitesimal unitaries, or equivalently, using power and band limited controls, can yield the best possible scaling in time $O(d^2)$.
Many quantum computational tasks have inherent symmetries, suggesting a path to enhancing their efficiency and performance. Exploiting this observation, we propose representation matching, a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks, including remote execution of unitary gate arrays, permutation gates and unitary conjugation, as well as the storage and retrieval of unitary gates.
We present a local optimal control strategy to produce desired unitary transformations. Unitary transformations are central to all quantum computational algorithms. Many realizations of quantum computation use a submanifold of states, comprising the quantum register, coupled by an external driving field to a collection of additional mediating excited states. Previous attempts to apply control theory to induce unitary transformations on the quantum register, while successful, produced pulses that drive the population out of the computational register at intermediate times. Leakage of population…
We investigate the equivalence of bipartite quantum mixed states under local unitary transformations by introducing representation classes from a geometrical approach. It is shown that two bipartite mixed states are equivalent under local unitary transformations if and only if they have the same representation class. Detailed examples are given on calculating representation classes.
In this paper we provide an explicit parameterization of arbitrary unitary transformation acting on n qubits, in terms of one and two qubit quantum gates. The construction is based on successive Cartan decompositions of the semi-simple Lie group, SU(2^n). The decomposition highlights the geometric aspects of building an arbitrary unitary transformation out of quantum gates and makes explicit the choice of pulse sequences for the implementation of arbitrary unitary transformation on $n coupled spins. Finally we make observations on the optimality of the design procedure.
We analyze the problem of comparing unitary transformations. The task is to decide, with minimal resources and maximal reliability, whether two given unitary transformations are identical or different. It is possible to make such comparisons without obtaining any information about the individual transformations. Different comparison strategies are presented and compared with respect to their efficiency. With an interferometric setup, it is possible to compare two unitary transforms using only one test particle. Another strategy makes use of a two-particle singlet state. This strategy is more e…
It is shown in the paper that the unitary quantum dynamics in quantum mechanics is the universal quantum driving force to speed up a quantum computation. This assertion supports strongly in theory that the unitary quantum dynamics is the fundamental and universal principle in nature. On the other hand, the symmetric structure of Hilbert space of a composite quantum system is the quantum-computing resource that is not owned by classical computation. A new quantum-computing speedup theory is set up on the basis of the unitary quantum dynamics. Both the unitary quantum dynamics and the symmetric …
We review the q-deformed spin network approact to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. These methods produce a concise proof that quantum computation can be performed within a single representation of the Artin Braid Group.
In the study of quantum computation, data is represented in terms of linear operators which form a generalized model of probability, and computations are most commonly described as products of unitary transformations, which are the transformations which preserve the quality of the data in a precise sense. This naturally leads to "unitary circuit models", which are models of computation in which unitary operators are expressed as a product of "elementary" unitary transformations. However, unitary transformations can also be effected as a composition of operations which are not all unitary thems…
The aim of the article is to show how a coordinate transformation can be applied to the path-integral formalism. For this purpose the unitary definition of the quantum measure, which guarantees the conservation of total probability, is offered. As the examples, the phase space transformation to the canonically conjugate pare $(energy, time)$ and the transformation to the cylindrical coordinates are shown. The transformations of the path-integral measure looks classically but they can not be deduced from naive transformations of quantum trajectories.
Quantum correlations in the state of four-level atom are investigated by using generic unitary transforms of the classical (diagonal) density matrix. Partial cases of pure state, $X$-state, Werner state are studied in details. The geometrical meaning of unitary Hilbert reference-frame rotations generating entanglement in the initially separable state is discussed. Characteristics of the entanglement in terms of concurrence, entropy and negativity are obtained as functions of the unitary matrix rotating the reference frame.
A quantum gate is realized by specific unitary transformations operating on states representing qubits. Considering a quantum system employed as an element in a quantum computing scheme, the task is therefore to enforce the pre-specified unitary transformation. This task is carried out by an external time dependent field. Optimal control theory has been suggested as a method to compute the external field which alters the evolution of the system such that it performs the desire unitary transformation. This study compares two recent implementations of optimal control theory to find the field tha…
A unitary dynamical state-locking (UNIDYSLOCK) process is a unitary process that can transform two orthogonal states to two non-orthogonal states. Its inverse process, i.e., the QUANSDAM process could realize an exponential QC speedup in solving an unstructured search problem in the quantum-computing (QC) speedup theory (X. Miao, arXiv:1105.3573 [quant-ph] (2011)). In this paper the principle of how a UNIDYSLOCK process works is described on the basis of the QC speedup theory. A UNIDYSLOCK process does not exist at all in pure quantum mechanics. That it can change the quantum-state difference …
The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the two-dimensional 1-qubit space. In this paper, we show that H and P(.) suffice to generate the unitary group U(2) and, consequently, through controlled-U operations and their concatenations, the entire unitary group U(2^n) on n-qubits can be generated. Since any quantum computing algorithm in an n-qubit quantum computer is based on operations by matrices in U(2^n), i…
In this paper, we study time-optimal control problems related to system of two coupled qubits where the time scales involved in performing unitary transformations on each qubit are significantly different. In particular, we address the case where unitary transformations produced by evolutions of the coupling take much longer time as compared to the time required to produce unitary transformations on the first qubit but much shorter time as compared to the time to produce unitary transformations on the second qubit. We present a canonical decomposition of SU(4) in terms of the subgroup SU(2)xSU…
The equivalence of tripartite pure states under local unitary transformations is investigated. The nonlocal properties for a class of tripartite quantum states in $\Cb^K \otimes \Cb^M \otimes \Cb^N$ composite systems are investigated and a complete set of invariants under local unitary transformations for these states is presented. It is shown that two of these states are locally equivalent if and only if all these invariants have the same values.
We show that all pure entangled states of two $d$-dimensional quantum systems (i.e., two qudits) can be generated from an initial separable state via a universal Yang--Baxter matrix if one is assisted by local unitary transformations.
We proposed a general transformation in probabilistic teleportation, which is based on different entanglement matching coefficients $K$ corresponding to different unitary evolution which provides one with more flexible evolution method experimentally. Through analysis based on the Bell basis and generalized Bell basis measurement for two probabilistic teleportation, we suggested a general probability of successful teleportation, which is not only determined by the entanglement degree of transmission channels and measurement methods, but also related to the unitary transformation in the telepor…
After proving a general no-cloning theorem for black boxes, we derive the optimal universal cloning of unitary transformations, from one to two copies. The optimal cloner is realized by quantum channels with memory, and greately outperforms the optimal measure-and-reprepare cloning strategy. Applications are outlined, including two-way quantum cryptographic protocols.
We address the problem of finding the optimal joint unitary transformation on system + ancilla which is the most efficient in programming any desired channel on the system by changing the state of the ancilla. We present a solution to the problem for dim(H)=2 for both system and ancilla.
We introduce a notion of Kolmogorov complexity of unitary transformation, which can (roughly) be understood as the least possible amount of information required to fully describe and reconstruct a given finite unitary transformation. In the context of quantum computing, it corresponds to the least possible amount of data to define and describe a quantum circuit or quantum computer program. Our Kolmogorov complexity of unitary transformation is built upon Kolmogorov "qubit complexity" of Berthiaume, W. Van Dam and S. Laplante via mapping from unitary transformations to positive operators, which…
The variational quantum eigensolver (VQE) algorithm combines the ability of quantum computers to efficiently compute expectation values with a classical optimization routine in order to approximate ground state energies of quantum systems. In this paper, we study the application of VQE to the simulation of molecular energies using the unitary coupled cluster (UCC) ansatz. We introduce new strategies to reduce the circuit depth for the implementation of UCC and improve the optimization of the wavefunction based on efficient classical approximations of the cluster amplitudes. Additionally, we pr…
The evolution of an open system is usually associated with the interaction of the system with an environment. A new method to study the open-type system evolution of a qubit (two-level atom) state is established. This evolution is determined by a unitary transformation applied to the qutrit (three-level atom) state, which defines the qubit subsystems. This procedure can be used to obtain different qubit quantum channels employing unitary transformations into the qutrit system. In particular, we study the phase damping and spontaneous-emission quantum channels. In addition, we mention a proposa…
An approach to the simulation of locally interacting systems is demonstrated and assayed. The proposal is built upon the concept of folding of bosonic modes previously introduced in the context of linear dynamics and can be seen as an alternative to Trotter-Susuki expansion in studies of quantum propagation based on tensor states. It is shown that evolution as well as ground state computations can be implemented and that test simulations deliver comparatively accurate results. The whole analysis provides insight into the way well-known quantum precursors affect mean values and fluctuations in …
We address the problem of the information-disturbance trade-off associated to the estimation of a quantum transformation, and show how the extraction of information about the a black box causes a perturbation of the corresponding input-output evolution. In the case of a black box performing a unitary transformation, randomly distributed according to the invariant measure, we give a complete solution of the problem, deriving the optimal trade-off curve and presenting an explicit construction of the optimal quantum network.
The optimal control of unitary transformations is a fundamental problem in quantum control theory and quantum information processing. The feasibility of performing such optimizations is determined by the computational and control resources required, particularly for systems with large Hilbert spaces. Prior work on unitary transformation control indicates that (i) for controllable systems, local extrema in the search landscape for optimal control of quantum gates have null measure, facilitating the convergence of local search algorithms; but (ii) the required time for convergence to optimal con…
Robust control design for quantum unitary transformations has been recognized as a fundamental and challenging task in the development of quantum information processing due to unavoidable decoherence or operational errors in the experimental implementation of quantum operations. In this paper, we extend the systematic methodology of sampling-based learning control (SLC) approach with a gradient flow algorithm for the design of robust quantum unitary transformations. The SLC approach first uses a "training" process to find an optimal control strategy robust against certain ranges of uncertainti…
This paper addresses the problem of designing universal quantum circuits to transform $k$ uses of a $d$-dimensional unitary input-operation into a unitary output-operation in a probabilistic heralded manner. Three classes of protocols are considered, parallel circuits, where the input-operations can be simultaneously, adaptive circuits, where sequential uses of the input-operations are allowed, and general protocols, where the use of the input-operations may be performed without a definite causal order. For these three classes, we develop a systematic semidefinite programming approach that fin…
The construction of unitary operator bases in a finite-dimensional Hilbert space is reviewed through a nonstandard approach combinining angular momentum theory and representation theory of SU(2). A single formula for the bases is obtained from a polar decomposition of SU(2) and analysed in terms of cyclic groups, quadratic Fourier transforms, Hadamard matrices and generalized Gauss sums. Weyl pairs, generalized Pauli operators and their application to the unitary group and the Pauli group naturally arise in this approach.
A conditioned unitary transformation ($90^o$ polarization rotation) is performed at single-photon level. The transformation is realized by rotating polarization for one of the photons of a polarization-entangled biphoton state (signal photon) by means of a Pockel's cell triggered by the detection of the other (idler) photon after polarization selection. As a result, polarization degree for the signal beam changes from zero to the value given by the idler detector quantum efficiency. This result is relevant to practical realization of various quantum information schemes and can be used for deve…
The famous Johnson-Lindenstrauss lemma states that for any set of n vectors, there is a linear transformation into a space of dimension O(log n) that approximately preserves all their lengths. In fact, a Haar random unitary transformation followed by projection onto the first O(log n) coordinates followed by a scaling works as a valid transformation with high probability. In this work, we show that the Haar random unitary can be replaced by a uniformly random unitary chosen from a finite set called an approximate unitary t-design for t = O(log n). Choosing a unitary from such a design requires…
One-way measurement based quantum computations (1WQC) may describe unitary transformations, via a composition of CPTP maps which are not all unitary themselves. This motivates the following decision problems: Is it possible to determine whether a ``quantum-to-quantum'' 1WQC procedure (having non-trivial input and output subsystems) performs a unitary transformation? Is it possible to describe precisely how such computations transform quantum states, by translation to a quantum circuit of comparable complexity? In this article, we present an efficient algorithm for transforming certain families…
Using the tool of unitary transformations of the extended receiver we perform simple operations with the non-diagonal elements of the initial sender's density matrix after their transferring to the receiver. These operations are following: turning some matrix elements to zero, rearranging the matrix elements and preparing their linear combinations with required coefficients. We also propose a protocol for solving a system of linear algebraic equations with a system of two equations as an example. Such operations are numerically simulated on the basis of 42-node spin-1/2 chain with the two-qubi…
A unitary operator which relates the system of a particle in a linear potential with time-dependent parameters to that of a free particle, has been given. This operator, closely related to the one which is responsible for the existence of coherent states for a harmonic oscillator, is used to find a general wave packet described by an Airy function. The kernel (propagator) and a complete set of Hermite-Gaussian type wave functions are also given.
We address the problem of learning an unknown unitary transformation from a finite number of examples. The problem consists in finding the learning machine that optimally emulates the examples, thus reproducing the unknown unitary maximum fidelity. Learning a unitary is equivalent to storing it in the state of a quantum memory (the memory of the learning machine), and subsequently retrieving it. We prove that, whenever the unknown unitary is drawn from a group, the optimal strategy consists in a parallel call of the available uses followed by a "measure-and-rotate" retrieving. Differing from t…
The reliable and precise generation of quantum unitary transformations is essential to the realization of a number of fundamental objectives, such as quantum control and quantum information processing. Prior work has explored the optimal control problem of generating such unitary transformations as a surface optimization problem over the quantum control landscape, defined as a metric for realizing a desired unitary transformation as a function of the control variables. It was found that under the assumption of non-dissipative and controllable dynamics, the landscape topology is trap-free, impl…
We review the q-deformed spin network approach to topological quantum field theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. The simplest case of these models is the Fibonacci model, itself universal for quantum computation. We here formulate these braid group representations in a shape suitable for computation and algebraic work.
We describe a general framework for regarding oracle-assisted quantum algorithms as tools for discriminating between unitary transformations. We apply this to the Deutsch-Jozsa problem and derive all possible quantum algorithms which solve the problem with certainty using oracle unitaries in a particular form. We also use this to show that any quantum algorithm that solves the Deutsch-Jozsa problem starting with a quantum system in a particular class of initial, thermal equilibrium-based states of the type encountered in solution state NMR can only succeed with greater probability than a class…
Optimal control techniques are applied for the decomposition of unitary quantum operations into a sequence of single-qubit gates and entangling operations. To this end, we modify a gradient-ascent algorithm developed for systems of coupled nuclear spins in molecules to make it suitable for trapped ion quantum computing. We decompose unitary operations into entangling gates that are based on a nonlinear collective spin operator and complemented by global spinflip and local light shift gates. Among others, we provide explicit decompositions of controlled-NOT and Toffoli gates, and a simple quant…
We study the unitary time evolution of a simple quantum Hamiltonian describing two harmonic oscillators coupled via a three-level system. The latter acts as an engine transferring energy from one oscillator to the other and is driven in a cyclic manner by time-dependent external fields. The S-matrix of the cycle is obtained in analytic form. The total number of quanta contained in the system is a conserved quantity. As a consequence the spectrum of the S-matrix is purely discrete and the evolution of the system is quasi-periodic.
Over decades quantum cryptography has been intensively studied for unconditionally secured data transmission in a quantum regime. Due to the quantum loopholes caused by imperfect single photon detectors and/or lossy quantum channels, however, the quantum cryptography is practically inefficient and even vulnerable to eavesdropping. Here, a method of unconditionally secured key distribution potentially compatible with current fiber-optic communications networks is proposed in a classical regime for high-speed optical backbone networks. The unconditional security is due to the quantum superpositi…
Estimating the eigenvalues of a unitary transformation U by standard phase estimation requires the implementation of controlled-U-gates which are not available if U is only given as a black box. We show that a simple trick allows to measure eigenvalues of U\otimes U^\dagger even in this case. Running the algorithm several times allows therefore to estimate the autocorrelation function of the density of eigenstates of U. This can be applied to find periodicities in the energy spectrum of a quantum system with unknown Hamiltonian if it can be coupled to a quantum computer.
The dynamics of a quantum system driven by an external field is well described by a unitary transformation generated by a time dependent Hamiltonian. The inverse problem of finding the field that generates a specific unitary transformation is the subject of study. The unitary transformation which can represent an algorithm in a quantum computation is imposed on a subset of quantum states embedded in a larger Hilbert space. Optimal control theory (OCT) is used to solve the inversion problem irrespective of the initial input state. A unified formalism, based on the Krotov method is developed lea…
