Related papers: An Efficient Quantum Circuit Construction Method f…
The characterization of quantum processes is a key tool in quantum information processing tasks for several reasons: on one hand, it allows to acknowledge errors in the implementations of quantum algorithms; on the other, it allows to…
A new method for compiling quantum algorithms is proposed and tested for a three qubit system. The proposed method is to decompose a a unitary matrix U, into a product of simpler U j via a neural network. These U j can then be decomposed…
We present a quantum circuit optimization technique that takes into account the variability in error rates that is inherent across present day noisy quantum computing platforms. This method can be run post qubit routing or post-compilation,…
We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls applying $n$ single-qubit arbitrary phase rotations from $4n b+\mathcal{O}(\sqrt{cn b})$ to $2n b+\mathcal{O}(\sqrt{cn…
In quantum information theory, it is a fundamental problem to construct multipartite unextendible product bases (UPBs). We show that there exist two families UPBs in Hilbert space…
Uniformly controlled one-qubit gates are quantum gates which can be represented as direct sums of two-dimensional unitary operators acting on a single qubit. We present a quantum gate array which implements any n-qubit gate of this type…
Current quantum devices face challenges when dealing with large circuits due to error rates as circuit size and the number of qubits increase. The circuit wire-cutting technique addresses this issue by breaking down a large circuit into…
Quantum random access codes (QRACs) provide a basic tool for demonstrating the advantages of quantum resources and protocols, which have a wide range of applications in quantum information processing tasks. However, the investigation and…
We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the…
To build a general-purpose quantum computer, it is crucial for the quantum devices to implement classical boolean logic. A straightforward realization of quantum boolean logic is to use auxiliary qubits as intermediate storage. This…
We study efficient generations of random diagonal-unitary matrices, an ensemble of unitary matrices diagonal in a given basis with randomly distributed phases for their eigenvalues. Despite the simple algebraic structure, they cannot be…
We study mutually unbiased maximally entangled bases (MUMEB's) in bipartite system $\mathbb{C}^d\otimes\mathbb{C}^d (d \geq 3)$. We generalize the method to construct MUMEB's given in [16], by using any commutative ring $R$ with $d$…
Mutually Unbiased bases has various application in quantum information procession and coding theory. There can be maximum d + 1 MUBs in C^d and d/2 +1 MUBs in R^d. But , over R^d MUBs are known to be non existent when d is odd and for most…
We show that in a complex d-dimensional vector space, one can find O(d) bases whose elements form a 2-design. Such vector sets generalize the notion of a maximal collection of mutually unbiased bases (MUBs). MUBs have manifold applications…
Universal quantum entangling gates are a crucial building block in the large-scale quantum computation and quantum communication, and it is an important task to find simple ways to implement them. Here an effective quantum circuit for the…
We study the implementation of quantum channels with quantum computers while minimizing the experimental cost, measured in terms of the number of Controlled-NOT (C-NOT) gates required (single-qubit gates are free). We consider three…
Uncertainty quantification (UQ) is essential for deploying machine learning models in safety-critical physical systems, yet classical Bayesian approaches incur substantial computational overhead. We establish a formal connection between…
Hybrid quantum-classical algorithms provide ways to use noisy intermediate-scale quantum computers for practical applications. Expanding the portfolio of such techniques, we propose a quantum circuit learning algorithm that can be used to…
Mutually unbiased measurements (MUMs) are generalized from the concept of mutually unbiased bases (MUBs) and include the complete set of MUBs as a special case, but they are superior to MUBs as they do not need to be rank one projectors. We…
We propose a new method of finding the mutually unbiased bases for three qubits. The key element is the construction of the table of striation-generating curves in the discrete phase space. We derive a system of equations in the Galois…