Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations. Using the "Sender-Receiver" model, we propose quantum algorithms for matrix operations such as matrix-vector product, matrix-matrix product, the sum of two matrices, and calculation of determinant and inverse of a matrix. We encode the matrix entries into the probability amplitudes of pure initial states of senders. After applying a proper unitary transformation to the complete quantum system, the desired result can be found in certain blocks of the receiver's density matrix. These quantum protocols can be used as subroutines in other quantum schemes. Furthermore, we present an alternative quantum algorithm for solving linear systems of equations.
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…
We solve the entanglement classification under stochastic local operations and classical communication (SLOCC) for general n-qubit states. For two arbitrary pure n-qubit states connected via local operations, we establish an equation between the two coefficient matrices associated with the states. The rank of the coefficient matrix is preserved under SLOCC and gives rise to a simple way of partitioning all the pure states of n qubits into different families of entanglement classes, as exemplified here. When applied to the symmetric states, this approach reveals that all the Dicke states |l,n> …
Given an orthonormal basis in a $d$-dimensional Hilbert space and a unital quantum operation $\cal E$ acting on it one can define a non-linear mapping that associates to $\cal E$ a $d\times d$ real-valued matrix that we call the Coherence Matrix of $\cal E$ with respect to $B$. We show that one can use this coherence matrix to define vast families of measures of the coherence generating power (CGP) of the operation. These measures have a natural geometrical interpretation as separation of $\cal E$ from the set of incoherent unital operations. The probabilistic approach to CGP discussed in P. Z…
We study multipartite entanglement under stochastic local operations and classical communication (SLOCC) and propose the entanglement classification under SLOCC for arbitrary-dimensional multipartite ($n$-qudit) pure states via the rank of coefficient matrix, together with the permutation of qudits. The ranks of the coefficient matrices have been proved to be entanglement monotones. The entanglement classification of the $2 \otimes 2 \otimes 2 \otimes 4$ system is discussed in terms of the generalized method, and 22 different SLOCC families are found.
Controlled operations allow for the entanglement of quantum registers. In particular, a controlled-$U$ gate allows an operation, $U$, to be applied to the target register and entangle the results to certain values in the control register. This can be generalised by making use of the classical notion of conditional statements, where if a value (or state) satisfies some condition then a sequence of operations can be performed. A method is introduced to represent these generalised controlled operations that are based on classical conditional statements. Throughout examples are given to highlight …
Fault-tolerant quantum computing demands many qubits with long lifetimes to conduct accurate quantum gate operations. However, external noise limits the computing time of physical qubits. Quantum error correction codes may extend such limits, but imperfect gate operations introduce errors to the correction procedure as well. The additional gate operations required due to the physical layout of qubits exacerbate the situation. Here, we use density-matrix simulations to investigate the performance change of logical qubits according to quantum error correction codes and qubit layouts and the expe…
This paper focuses on changing Fock matrix elements of two-mode squeezed vacuum state (TMSVS) by employing three quantum operations in one-sided lossy channel. These three quantum operations include one-photon replacement (OPR), one-photon substraction (OPS) and one-photon addition (OPA). Indeed, three conditional quantum states have been generated from the original TMSVS. Using the characteristic function (CF) representation of quantum density operator, we derive the analytical expressions of their Fock matrix elements, which are dependent on the interaction parameters, including the squeezin…
Quadrature correlations between subsystems of a Gaussian quantum state are fully characterised by its covariance matrix. For example, the covariance matrix determines the amount of entanglement or decoherence of the state. Here, we establish when it is possible to remove correlations between conjugate quadratures using only passive operations. Such correlations are usually undesired and arise due to experimental cross-quadrature contamination. Using the Autonne--Takagi factorisation, we present necessary and sufficient conditions to determine when such removal is possible. Our proof is constru…
In this paper we give a complete axiomatisation of qubit ZX-calculus via elementary transformations which are basic operations in linear algebra. This formalism has two main advantages. First, all the operations of the phases are algebraic ones without trigonometry functions involved, thus paved the way for generalising complete axiomatisation of qubit ZX-calculus to qudit ZX-calculus and ZX-calculus over commutative semirings. Second, we characterise elementary transformations in terms of ZX diagrams, so a lot of linear algebra stuff can be done purely diagrammatically.
We present a new approach to simulating Hamiltonian dynamics based on implementing linear combinations of unitary operations rather than products of unitary operations. The resulting algorithm has superior performance to existing simulation algorithms based on product formulas and, most notably, scales better with the simulation error than any known Hamiltonian simulation technique. Our main tool is a general method to nearly deterministically implement linear combinations of nearby unitary operations, which we show is optimal among a large class of methods.
Efficiently processing basic linear algebra subroutines is of great importance for a wide range of computational problems. In this paper, we consider techniques to implement matrix functions on a quantum computer, which are composed of basic matrix operations on a set of matrices. These matrix operations include addition, multiplication, Kronecker sum, tensor product, Hadamard product, and single-matrix functions. We discuss the composed matrix functions in terms of the estimation of scalar quantities such as inner products, trace, determinant and Schatten p-norms. We thus provide a framework …
Crosstalk Insensitive Trapped-Ion Entanglement through Coupling Matrix Engineering
Joint Center for Quantum Information and Computer Science, University of Maryland（马里兰大学量子信息与计算联合中心）；Department of Physics, University of Maryland（马里兰大学物理系）；Department of Electrical and Computer Engineering, University of Washington（华盛顿大学电气与计算机工程系）
We review Schmidt and Kraus decompositions in the form of singular value decomposition using operations of reshaping, vectorization and reshuffling. We use the introduced notation to analyse the correspondence between quantum states and operations with the help of Jamiolkowski isomorphism. The presented matrix reorderings allow us to obtain simple formulae for the composition of quantum channels and partial operations used in quantum information theory. To provide examples of the discussed operations we utilize a package for the Mathematica computing system implementing basic functions used in…
A C++ library, named ZKCM, has been developed for the purpose of multiprecision matrix calculations, which is based on the GNU MP and MPFR libraries. It is especially convenient for writing programs involving tensor-product operations, tracing-out operations, and singular-value decompositions. Its extension library, ZKCM_QC, for simulating quantum computing has been developed using the time-dependent matrix-product-state simulation method. This report gives a brief introduction to the libraries with sample programs.
We consider the density matrices derived from combinatorial laplacian matrix of graphs. Specifically, the star-relevant graph, which means adding certain edges on peripheral vertices of star graph, is the focus of this paper. Initially, we provide the spectrum of the density matrices corresponding to star-like graph(i.e., adding an edge on star graph) and present that the Von Neumann entropy will increase under the graph operation(adding an edge on star graph) and the graph operation cannot simulated by local operation and classical communication (LOCC). Subsequently, we illustrate the spectru…
We have proposed and demonstrated a scalable and efficient scheme for programmable unitary operations in orbital angular momentum (OAM) domain. Based on matrix decomposition into diagonal and Fourier factors, arbitrary matrix operators can be implemented only by diagonal matrices alternately acting on orbital angular momentum domain and azimuthal angle domain, which are linked by Fourier transform. With numerical simulations, unitary matrices with dimensionality of 3*3 are designed and discussed for OAM domain. Meanwhile, the parallelism of our proposed scheme is also presented with two 3*3 ma…
Spectral properties of an arbitrary matrix can be characterized by the entropy of its rescaled singular values. Any quantum operation can be described by the associated dynamical matrix or by the corresponding superoperator. The entropy of the dynamical matrix describes the degree of decoherence introduced by the map, while the entropy of the superoperator characterizes the a priori knowledge of the receiver of the outcome of a quantum channel Phi. We prove that for any map acting on a N--dimensional quantum system the sum of both entropies is not smaller than ln N. For any bistochastic map th…
Building upon our previous work, on graphical representation of a quantum state by signless Laplacian matrix, we pose the following question. If a local unitary operation is applied to a quantum state, represented by a signless Laplacian matrix, what would be the corresponding graph and how does one implement local unitary transformations graphically? We answer this question by developing the notion of local unitary equivalent graphs. We illustrate our method by a few, well known, local unitary transformations implemented by single-qubit Pauli and Hadamard gates. We also show how graph switchi…
The paper presents the classification of matrix valued superpotentials corresponding to shape invariant systems of Schrödinger equations. All inequivalent irreducible matrix superpotentials realized by matrices of arbitrary dimension with linear dependence on variable parameter are presented explicitly.
