Related papers: EQB: Synthesizing Permutative Quantum Gates and Ci…
The decomposition of matrices associated to two-qubit and three-qubit orthogonal gates is studied, and based on the decomposition the synthesis of these gates is investigated. The optimal synthesis of general two-qubit orthogonal gate is…
High-fidelity single- and two-qubit gates are essential building blocks for a fault-tolerant quantum computer. While there has been much progress in suppressing single-qubit gate errors in superconducting qubit systems, two-qubit gates…
In the paper, we consider quantum circuits for the Quantum Fourier Transform (QFT) algorithm. The QFT algorithm is a very popular technique used in many quantum algorithms. We present a generic method for constructing quantum circuits for…
In this paper we apply the canonical decomposition of two qubit unitaries to find pulse schemes to control the proposed Kane quantum computer. We explicitly find pulse sequences for the CNOT, swap, square root of swap and controlled Z…
In this paper we propose QContext, a new compiler structure that incorporates context-aware and topology-aware decompositions. Because of circuit equivalence rules and resynthesis, variants of a gate-decomposition template may exist.…
What is the time-optimal way of realizing quantum operations? Here, we show how important instances of this problem can be related to the study of shortest paths on the surface of a sphere under a special metric. Specifically, we provide an…
We develop schemes for designing pulses that implement fast and precise entangling quantum gates in superconducting qubit systems despite the presence of nearby harmful transitions. Our approach is based on purposely involving the nearest…
In this paper, we exclusively utilize CNOT gates for implementing permutation groups generated by more than two elements. In Lemma 1, we recall that three CNOT gates are both necessary and sufficient to execute a two-qubit swap gate…
The practical use of many types of near-term quantum computers requires accounting for their limited connectivity. One way of overcoming limited connectivity is to insert swaps in the circuit so that logical operations can be performed on…
A quantum computer will use the properties of quantum physics to solve certain computational problems much faster than otherwise possible. One promising potential implementation is to use superconducting quantum bits in the circuit quantum…
Variational quantum algorithms, inspired by neural networks, have become a novel approach in quantum computing. However, designing efficient parameterized quantum circuits remains a challenge. Quantum architecture search tackles this by…
We study the two-qubit controlled-not gate operating on qubits encoded in the spin state of a pair of electrons in a double quantum dot. We assume that the electrons can tunnel between the two quantum dots encoding a single qubit, while…
High-fidelity and robust quantum manipulation is the key for scalable quantum computation. Therefore, due to the intrinsic operational robustness, quantum manipulation induced by geometric phases is one of the promising candidates. However,…
Linear optical quantum computing (LOQC) offers a quantum computation paradigm based on well-established and robust technology and flexible environmental conditions following DiVincenzo's criteria. Within this framework, integrated photonics…
We present a new implementation of quantum computation that treats quantum computers as a special type of Bayesian Network called a QuDot Net. QuDot Nets allow for the efficient representation of some qubit systems. Single qubit quantum…
Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits…
We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be…
Mutually unbiased bases (MUBs) play a crucial role in numerous applications within quantum information science, such as quantum state tomography, error correction, entanglement detection, and quantum cryptography. Utilizing \(2^n + 1\) MUB…
We study two-level q-deformed angular momentum states and us- ing q-deformed harmonic oscillators, we provide a framework for con- structing qubits and quantum gates. We also present the construction of some basic quantum gates including…
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…