We demonstrate how structured decompositions of unitary operators can be employed to derive control schemes for finite-level quantum systems that require only sequences of simple control pulses such as square wave pulses with finite rise and decay times or Gaussian wavepackets. To illustrate the technique it is applied to find control schemes to achieve population transfers for pure-state systems, complete inversions of the ensemble populations for mixed-state systems, create arbitrary superposition states and optimize the ensemble average of dynamic observables.
Some problems of the quantum error-correcting codes theory can be reduced to the investigation of the higher-rank numerical ranges of the operators related to the error operators. We constructively verify a conjecture on the structure of higher-rank numerical range for unitary matrices.
In this work we present a method of decomposition of arbitrary unitary matrix $U\in\mathbf U(2^k)$ into a product of single-qubit negator and controlled-$\sqrt{\mbox{NOT}}$ gates. Since the product results with negator matrix, which can be treated as complex analogue if bistochastic matrix, our method can be seen as complex analogue of Sinkhorn-Knopp algorithm, where diagonal matrices are replaced by adding and removing an one-qubit ancilla. The decomposition can be found constructively and resulting circuit consists of $O(4^k)$ entangling gates, which is proved to be optimal. An example of su…
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 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.
Quantum computation is a continuously growing research area which is based on nature and resources of quantum mechanics, as superposition and entanglement. In its quantum circuits version, the use of convenient and appropriate gates is essential. But while those gates adopt convenient forms for computational algorithms, their design depends on specific quantum systems and stu? being used. These gates need manage quantum systems based on physical interactions ruled by quantum Hamiltonians. With this, gates design is restricted to properties and limitations of interactions and physical elements …
The work presented here extends upon the best known universal quantum circuit, the Quantum Shannon Decomposition proposed in [Vivek V. Shende, Stephen S. Bullock and Igor Markov, Synthesis of Quantum Logic Circuits, IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 25 (6): 1000-1010 (2006)]. We obtain the basis of the circuit's design in a pair of Cartan decompositions. This insight gives a simple constructive algorithm for obtaining the Quantum Shannon Decomposition of a given unitary matrix in terms of the corresponding Cartan involutions.
In 1960 Schwinger [J. Schwinger, Proc.Natl.Acad.Sci. 46 (1960) 570- 579] proposed the algorithm for factorization of unitary operators in the finite M dimensional Hilbert space according to a coprime decomposition of M. Using a special permutation operator A we generalize the Schwinger factorization to every decomposition of M. We obtain the factorized pairs of unitary operators and show that they obey the same commutation relations as Schwinger's. We apply the new factorization to two problems. First, we show how to generate two kq-like mutually unbiased bases for any composite dimension. The…
The relation between Bell-CHSH violation and factorization of Hilbert space is considered here. That is, a state which is local in the sense of the Bell-CHSH inequality under a certain factorization of the underlying Hilbert space can be Bell-CHSH non-local under a different factorization. While this question has been addressed with respect to separability , the relation of the factorization with Bell-CHSH violation has remained hitherto unexplored. We find here, that there is a set containing density matrices which do not exhibit Bell-CHSH violation under any factorization of the Hilbert spac…
Nature provides us with a restricted set of microscopic interactions. The question is whether we can synthesize out of these fundamental interactions an arbitrary unitary operator. In this paper we present a constructive algorithm for realization of any unitary operator which acts on a (truncated) Hilbert space of a single bosonic mode. In particular, we consider a physical implementation of unitary transformations acting on 1-dimensional vibrational states of a trapped ion. As an example we present an algorithm which realizes the discrete Fourier transform.
In this paper it has been described how to use the unitary dynamics of quantum mechanics to solve the prime factorization problem on a spin ensemble without any quantum entanglement. The ensemble quantum computation for the prime factorization is based on the basic principle that both a closed quantum system and its ensemble obey the same unitary dynamics of quantum mechanics if there is not any decoherence effect in both the quantum system and its ensemble. It uses the NMR multiple-quantum measurement techniques to output the quantum computational results that are the inphase multiple-quantum…
We present a constructive proof of Floquet's theorem for the special case of unitary time evolution in quantum mechanics. The proof is straightforward and suitable for study in courses on quantum mechanics.
We describe a decomposition of the Lie group of unitary evolutions for a bipartite quantum system of arbitrary dimensions. The decomposition is based on a recursive procedure which systematically uses the Cartan classification of the symmetric spaces of the Lie group SO(n). The resulting factorization of unitary evolutions clearly displays the local and entangling character of each factor.
We study quantum entanglements induced on product states by the action of 8-vertex braid matrices, rendered unitary with purely imaginary spectral parameters (rapidity). The unitarity is displayed via the "canonical factorization" of the coefficients of the projectors spanning the basis. This adds one more new facet to the famous and fascinating features of the 8-vertex model. The double periodicity and the analytic properties of the elliptic functions involved lead to a rich structure of the 3-tangle quantifying the entanglement. We thus explore the complex relationship between topological an…
There exist zero-temperature states in quantum many-body systems that are fully factorized, thereby possessing vanishing entanglement, and hence being of no use as resource in quantum information processing tasks. Such states can become useful for quantum protocols when the temperature of the system is increased, and when the system is allowed to evolve under either the influence of an external environment, or a closed unitary evolution driven by its own Hamiltonian due to a sudden change in the system parameters. Using the one-dimensional anisotropic XY model in a uniform and an alternating t…
We introduce a method for analyzing ground state properties of quantum many body systems, based on the characterization of separability and entanglement by single subsystem unitary operations. We apply the method to the study of the ground state structure of several interacting spin-1/2 models, described by Hamiltonians with different degrees of symmetry. We show that the approach based on single qubit unitary operations allows to introduce {\it ``entanglement excitation energies''}, a set of observables that can characterize ground state properties, including the quantification of single-site…
The aim of the paper is to provide a constructive method for recovering a unitary matrix from experimental data. Since there is a natural immersion of unitary matrices within the set of double stochastic ones, the problem to solve is to find necessary and sufficient criteria that separate the two sets. A complete solution is provided for the 3-dimensional case, accompanied by a $χ^2$ test necessary for the reconstruction of a unitary matrix from error affected data.
We present a constructive control scheme for solving quantum state engineering problems based on a parametrization of the state vector in terms of complex hyperspherical coordinates. Unlike many control schemes based on factorization of unitary operators the scheme gives explicit expressions for all the Euler angles in terms of the hyperspherical coordinates of the initial and final state. The factorization, when applicable, has added benefits that phase rotations can be combined and performed concurrently. The control procedure can be realized using a simple bang-bang or square-wave-function …
Ideal quantum algorithms usually assume that quantum computing is performed continuously by a sequence of unitary transformations. However, there always exist idle finite time intervals between consecutive operations in a realistic quantum computing process. During these delays, coherent "errors" will accumulate from the dynamical phases of the superposed wave functions. Here we explore the sensitivity of Shor's quantum factoring algorithm to such errors. Our results clearly show a severe sensitivity of Shor's factorization algorithm to the presence of delay times between successive unitary tr…
We study the occurrence of ground-state factorization in dimerized $XY$ spin chains in a transverse field. Together with the usual ferromagnetic and antiferromagnetic regimes, a third case emerges, with no analogous in translationally-invariant systems, consisting of an antiferromagnetic Neél-type ground state where pairs of spins represent the unitary cell. Then, we calculate the exact solution of the model and show that the factorizing field represent an accidental degeneracy point of the Hamiltonian. Finally, we extend the study of the existence of ground-state factorization to a more gener…
Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary gates on an open quantum system without encoding or measurement overhead. Our results allow for a low-level error correction strategy solely based on Hamiltonian engineering using realistic bounded-strength controls and may substantially reduce implementation requirements for fault-tolerant quantum computing architectures.
Robust multi-hypothesis quantum-state discrimination under unknown common unitary perturbations via least favorable priors
Graduate School of Engineering Science, The University of Osaka（大阪大学工程科学研究科）；Center for Education in Liberal Arts and Sciences, The University of Osaka（大阪大学通识教育中心）；Center for Quantum Information and Quantum Biology, The University of Osaka（大阪大学量子信息与量子生物学中心）
Inspired by non-abelian vortex anyons in spinor Bose-Einstein condensates, we consider the quantum double $\mathcal{D}(Q_8)$ anyon model as a platform to carry out a particular instance of Shor's factorization algorithm. We provide the excitation spectrum, the fusion rules, and the braid group representation for this model, and design a circuit architecture that facilitates the computation. All necessary quantum gates, less one, can be compiled exactly for this hybrid topological quantum computer, and to achieve universality the last operation can be implemented in a non-topological fashion. T…
The most efficient known quantum circuits for preparing unitary coupled cluster states and applying Trotter steps of the arbitrary basis electronic structure Hamiltonian involve interleaved sequences of fermionic Gaussian circuits and Ising interaction type circuits. These circuits arise from factorizing the two-body operators generating those unitaries as a sum of squared one-body operators that are simulated using product formulas. We introduce a numerical algorithm for performing this factorization that has an iteration complexity no worse than single particle basis transformations of the t…
One-parameter interpolations between any two unitary matrices (e.g., quantum gates) $U_1$ and $U_2$ along efficient paths contained in the unitary group are constructed. Motivated by applications, we propose the continuous unitary path $U(θ)$ obtained from the QR-factorization \[ U(θ)R(θ)=(1-θ)A+θB, \] where $U_1 R_1=A$ and $U_2 R_2=B$ are the QR-factorizations of $A$ and $B$, and $U(θ)$ is a unitary for all $θ$ with $U(0)=U_1$ and $U(1)=U_2$. The QR-algorithm is modified to, instead of $U(θ)$, output a matrix whose columns are proportional to the corresponding columns of $U(θ)$ and whose entr…
Quantum-mechanical concepts can be formulated in constructive finite terms without loss of their empirical content if we replace a general unitary group by a unitary representation of a finite group. Any linear representation of a finite group can be realized as a subrepresentation of a permutation representation. Thus, quantum-mechanical problems can be expressed in terms of permutation groups. This approach allows us to clarify the meaning of a number of physical concepts. Combining methods of computational group theory with Monte Carlo simulation we study a model based on representations of…
A unitary coupled-cluster (UCC) form for the wavefunction in the variational quantum eigensolver has been suggested as a systematic way to go beyond the mean-field approximation and include electron correlation in solving quantum chemistry problems on a quantum computer. Although being exact in the limit of including all possible coupled-cluster excitations, practically, the accuracy of this approach depends on how many and what kind of terms are included in the wavefunction parametrization. Another difficulty of UCC is a growth of the number of simultaneously entangled qubits even at the fixe…
Recent work on recurrence in quantum walks has provided a representation of Schur functions in terms of unitary operators. We propose a generalization of Schur functions by extending this operator representation to arbitrary operators on Banach spaces. Such generalized Schur functions meet the formal structure of first return generating functions, thus we call them FR-functions. We derive general properties of FR-functions, among them a generalization of the renewal equation already known for random and quantum walks, as well as splitting properties which extend useful factorizations of Schur …
Epsilon-nets and approximate unitary $t$-designs are natural notions that capture properties of unitary operations relevant for numerous applications in quantum information and quantum computing. The former constitute subsets of unitary channels that are epsilon-close to any unitary channel in the diamond norm. The latter are ensembles of unitaries that (approximately) recover Haar averages of polynomials in entries of unitary channels up to order $t$. In this work we establish quantitative connections between these two notions. Specifically, we prove that, for a fixed dimension $d$ of the Hil…
