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)$.
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.
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.
We show that several Hamiltonians that are $\mathcal{PT}$ symmetric may be taken to Hermitian Hamiltonians via a non-unitary transformation and vice versa. We also show that for some specific Hamiltonians such non-unitary transformations may be associated, via a fractional-Wick rotation, to complex time.
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…
We concretely construct an extension of the controlled-U gate in qudit from some elementary gates. We also construct unitary transformation in two-qudit by means of the extended controlled-U gate and show the universality of it.
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…
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.
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.
We show that in principle, $N$-partite unitary transformations can be perfectly discriminated under local measurement and classical communication (LOCC) despite of their nonlocal properties. Based on this result, some related topics, including the construction of the appropriate quantum circuit together with the extension to general completely positive trace preserving operations, are discussed.
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…
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.
In this paper the geometry of two-qubit systems under local unitary group $SO(2)\otimes SU(2)$ is discussed. It is shown that the quaternionic conformal map intertwines between this local unitary subgroup of $Sp(2)$ and the quaternionic Möbius transformation which is rather a generalization of the results of Lee et al (2002 Quantum Inf. Process. 1 129).
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 present a way of treating the problem of the interaction of a single trapped ion with laser beams based on successive aplications of unitary transformations onto the Hamiltonian. This allows the diagonalization of the Hamiltonian, by means of recursive relations, without performing the Lamb-Dicke approximation.
The equivalence of arbitrary dimensional bipartite states under local unitary transformations (LUT) is studied. A set of invariants and ancillary invariants under LUT is presented. We show that two states are equivalent under LUT if and only if they have the same values for all of these invariants.
In the present time we observe a growing number of publications where the, so-called, flow equations are successfully used to diagonalize Hamiltonians by means of an appropriate unitary transformation. Here we discuss and compare the flow equations (FE) method (proposed in 1994) with the method of one step continuous unitary transformations (OS CUT) (proposed in 1982). It is shown that the FE method can be considered as a generalization of the OS CUT approach to the case of parameter dependent generator. The OS CUT method gives linear differential equations for the diagonalization procedure. I…
It is generally accepted that no `faster than light signalling' (FTLS) using two entangled spin 1/2 particles is possible because of indeterminism in a quantum measurement and linearity of standard quantum mechanics. We show how in principle one bit of information could be transmitted using local measurements and a global unitary transformation of the state of two entangled spatially separated spin 1/2 particles. Assuming that the postulate of a state collapse due to measurement is valid, the no FTLS condition is saved if we do not have physical access to the required global unitary transforma…
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.
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.
In this paper we analyze a recent application of perturbation theory by the moment method to a family of two-dimensional anharmonic oscillators. By means of straightforward unitary transformations we show that two of the models studied by the authors are separable. Other is unbounded from below and therefore cannot be successfully treated by perturbation theory unless a complex harmonic frequency is introduced in the renormalization process. We calculate the lowest resonance by means of complex-coordinate rotation and compare its real part with the eigenvalue estimated by the authors. A pair o…
We consider the remote state creation via the homogeneous spin-1/2 chain and show that the significant extension of the creatable region can be achieved using the local unitary transformation of the so-called extended receiver (i.e. receiver joined with the nearest node(s)). This transformation is { most} effective in the models with all-node interactions. We consider the model with the two-qubit sender, one-qubit receiver and two-qubit extended receiver.
We present a novel approach for studying the dynamics of a superconducting qubit in a cavity. We succeed in linearizing the Hamiltonian through the application of an appropriate unitary transformation followed by a rotating wave approximation (RWA). For certain values of the parameters involved, we show that it is possible to obtain a a Jaynes-Cummings type Hamiltonian. As an example, we show the existence of super-revivals for the qubit inversion.
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.
A new form of local unitary (LU) transformation invariant is given for multi-qubit states . The general relation between tangle and the LU transformation invariant of pure three and four-qubit states is given. We find that the tangle actually is a special LU transformation invariant. Furthermore, the tangle is a important local unitary (LU) transformation invariant which is a nessesary condition for maximally multi-qubit entangled state.
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…
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…
The equivalence problem under local unitary transformation for $n$--partite pure states is reduced to the one for $(n-1)$--partite mixed states. In particular, a tripartite system $\mathcal{H}_A\otimes\mathcal{H}_B\otimes\mathcal{H}_C$, where $\mathcal{H}_j$ is a finite dimensional complex Hilbert space for $j=A,B,C$, is considered and a set of invariants under local transformations is introduced, which is complete for the set of states whose partial trace with respect to $\mathcal{H}_A$ belongs to the class of generic mixed states.
In previous work the authors introduced a notion of generic states and obtained criteria for local equivalence of them. Here they introduce the concept of CHG states maintaining the criteria of local equivalence. This fact allows the authors to halve the number of invariants necessary to characterize the equivalence classes under local unitary transformations for the set of tripartite states whose partial trace with respect to one of the subsystems belongs to the class of CHG mixed states.
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 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…
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 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…
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…
Hypergraph states form a family of multiparticle quantum states that generalizes cluster states and graph states. We study the action and graphical representation of nonlocal unitary transformations between hypergraph states. This leads to a generalization of local complementation and graphical rules for various gates, such as the CNOT gate and the Toffoli gate. As an application, we show that already for five qubits local Pauli operations are not sufficient to check local equivalence of hypergraph states. Furthermore, we use our rules to construct entanglement witnesses for three-uniform hype…
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…
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 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…
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…
We show that the Hadamard and Unitary gates could be implemented by a unitary evolution together with a measurement for any unknown state chosen from a set $A = {{| {Ψ_i} > ,| {\bar Ψ_i} >}}({i = 1,2})$ if and only if $| {Ψ_1} > ,| {Ψ_2} > ,| {\bar Ψ_1} > ,| {\bar Ψ_2} >$ are linearly independent. We also derive the best transformation efficiencies.
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.
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…
A general method for implementing weakly entangling multipartite unitary operations using a small amount of entanglement and classical communication is presented. For the simple Hamiltonian σ_z\otimesσ_z this method requires less entanglement than previously known methods. In addition, compression of multiple operations is applied to reduce the average communication required.
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.
Discrimination of unitary operations is a fundamental quantum information processing task. Assisted with linear optical elements, we experimentally demonstrate perfect discrimination between single-bit unitary operations using two methods--sequential scheme and parallel scheme. The complexity and resource consumed in these two schemes are analyzed and compared.
The geometric phase for a pure quantal state undergoing an arbitrary evolution is a ``memory'' of the geometry of the path in the projective Hilbert space of the system. We find that Uhlmann's geometric phase for a mixed quantal state undergoing unitary evolution not only depends on the geometry of the path of the system alone but also on a constrained bi-local unitary evolution of the purified entangled state. We analyze this in general, illustrate it for the qubit case, and propose an experiment to test this effect. We also show that the mixed state geometric phase proposed recently in the c…
We demonstrate a method for general linear optical networks that allows one to factorize any SU($n$) matrix in terms of two SU($n-1)$ blocks coupled by an SU(2) entangling beam splitter. The process can be recursively continued in an efficient way, ending in a tidy arrangement of SU(2) transformations. The method hinges only on a linear relationship between input and output states, and can thus be applied to a variety of scenarios, such as microwaves, acoustics, and quantum fields.
We consider two capacity quantities associated with bipartite unitary gates: the entangling and the disentangling power. For two-qubit unitaries these two capacities are always the same. Here we prove that these capacities are different in general. We do so by constructing an explicit example of a qubit-qutrit unitary whose entangling power is maximal (2 ebits), but whose disentangling power is strictly less. A corollary is that there can be no unique ordering for unitary gates in terms of their ability to perform non-local tasks. Finally we show that in large dimensions, almost all bipartite …
We propose a scheme of quantum secret sharing between Alices' group and Bobs' group with single photons and unitary transformations. In the protocol, one member in Alices' group prepares a sequence of single photons in one of four different states, while other members directly encode their information on the sequence of single photons via unitary operations, after that the last member sends the sequence of single photons to Bobs' group. Then Bobs except for the last one do work similarly. Finally last member in Bobs' group measures the qubits. If Alices and Bobs guarnnted the security of quant…
Graph states are quantum states that can be described by a stabilizer formalism and play an important role in quantum information processing. We consider the action of local unitary operations on graph states and hypergraph states. We focus on non-Clifford operations and find for certain transformations a graphical description in terms of weighted hypergraphs. This leads to the indentification of hypergraph states that are locally equivalent to graph states. Moreover, we present a systematic way to construct pairs of graph states which are equivalent under local unitary operations, but not equ…
