Related papers: An Efficient Quantum Circuit Construction Method f…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…
The matrix product state (MPS) belongs to the most important mathematical models in, for example, condensed matter physics and quantum information sciences. However, to realize an $N$-qubit MPS with large $N$ and large entanglement on a…
The execution of quantum circuits on real systems has largely been limited to those which are simply time-ordered sequences of unitary operations followed by a projective measurement. As hardware platforms for quantum computing continue to…
Quantum computing is an emerging technology that has the potential to revolutionize fields such as cryptography, machine learning, optimization, and quantum simulation. However, a major challenge in the realization of quantum algorithms on…
This short note highlights the most prominent mathematical problems and physical questions associated with the existence of the maximum sets of mutually unbiased bases (MUBs) in the Hilbert space of a given dimension
Efficient understanding of a quantum system fundamentally relies on the selection of observables. Pauli observables and mutually unbiased bases (MUBs) are widely used in practice and are often regarded as theoretically optimal for quantum…
In this paper, we derive optimized measurement-free protocols for quantum error correction and the implementation of a universal gate set optimized for an error model that is noise biased . The noise bias is adapted for neutral atom…
We propose a method for constructing $\texttt{PREPARE}$ circuits for quantum phase estimation of a molecular Hamiltonian in quantum chemistry by using variational optimization of quantum circuits solely on classical computers. The…
This letter introduces a novel compact and lossless quantum microgrid formation (qMGF) approach to achieve efficient operational optimization of the power system and improvement of resilience. This is achieved through lossless reformulation…
We present a 1D repetition code based on the so-called cat qubits as a viable approach toward hardware-efficient universal and fault-tolerant quantum computation. The cat qubits that are stabilized by a two-photon driven-dissipative…
Designing photonic circuits that prepare graph states with high fidelity and success probability is a central challenge in linear optical quantum computing. Existing approaches rely on hand-crafted designs or fusion-based assemblies. In the…
An important problem in quantum information is to construct multiqubit unextendible product bases (UPBs). By using the unextendible orthogonal matrices, we construct a 7-qubit UPB of size 11. It solves an open problem in [Quantum…
In this work, we report on a novel quantum state reconstruction process based on the disentanglement algorithm. Using variational quantum circuits, we disentangle the quantum state to a product of computational zero states. Inverse…
The structural characterization of high-dimensional mutually unbiased bases (MUBs) by classifying MUBs subsets remains a major open problem. The existing methods not only fail to conclude on the exact classification, but also are severely…
Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates. However, as circuit depth and gate number increase, gate imperfections and qubit decoherence…
The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that…
Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of $T$ gates of about $1/3$ of what is required by optimal, deterministic, ancilla-free decompositions…
The Measurement Based Quantum Computation (MBQC) model achieves universal quantum computation by employing projective single qubit measurements with classical feedforward on a highly entangled multipartite cluster state. Rapid advances in…
Compiling quantum circuits to account for hardware restrictions is an essential part of the quantum computing stack. Circuit compilation allows us to adapt algorithm descriptions into a sequence of operations supported by real quantum…
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…