Related papers: A quantum compiler design method by using linear c…
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
We discuss possible applications of the 1-D direct and inverse scattering problem to design of universal quantum gates for quantum computation. The potentials generating some universal gates are described.
Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit…
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…
In a recent paper, a new method was proposed to find the common invariant subspaces of a set of matrices. This paper invstigates the more general problem of putting a set of matrices into block triangular or block-diagonal form…
Existing quantum compilers optimize quantum circuits by applying circuit transformations designed by experts. This approach requires significant manual effort to design and implement circuit transformations for different quantum devices,…
Quantum algorithms offer significant speed-ups over their classical counterparts in various applications. In this paper, we develop quantum algorithms for the Kalman filter widely used in classical control engineering using the block…
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…
Any square matrix can be transformed into a doubly stochastic matrix via Sinkhorn scaling with diagonal matrices or completing to a larger dimensional matrix. Standard Birkhoff-von Neumann and Pauli decompositions represent such matrices as…
In this paper, we consider matrices given as a linear combination of permutations and analyze the impact of bit and phase-flips on the perturbation of the eigenvalues. When the coefficients in the linear combination are positive, we observe…
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…
Creation of quantum computer is outstanding fundamental and practical problem. The quantum computer could be used for execution of very complicated tasks which are not solvable with the classical computers. The first prototype of solid…
A large-scalable quantum computer model, whose qubits are represented by the subspace subtended by the ground state and the single exciton state on semiconductor quantum dots, is proposed. A universal set of quantum gates in this system may…
Quantum circuit mapping is a crucial process in the quantum circuit compilation pipeline, facilitating the transformation of a logical quantum circuit into a list of instructions directly executable on a target quantum system. Recent…
Matrices with the displacement structures of circulant, Toeplitz, and Hankel types as well as matrices with structures generalizing these types are omnipresent in computations of sciences and engineering. In this paper, we present efficient…
We present a dynamic learning paradigm for "programming" a general quantum computer. A learning algorithm is used to find the control parameters for a coupled qubit system, such that the system at an initial time evolves to a state in which…
The possibility of simulating a stochastic process by the intrinsic randomness of quantum system is investigated. Two simulations of Markov Chains by the measurements of quantum systems are proposed.
A new method for simulation of a binary homogeneous Markov process using a quantum computer was proposed. This new method allows using the distinguished properties of the quantum mechanical systems -- superposition, entanglement and…
Continuous-variable measurement-based quantum computation, which requires deterministically generated large-scale cluster state, is a promising candidate for practical, scalable, universal, and fault-tolerant quantum computation. In this…
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…