Related papers: An Efficient Quantum Circuit Construction Method f…
Measurement-based quantum computation (MBQC) is a universal platform to realize unitary gates, only using measurements which act on a pre-prepared entangled resource state. By deforming the measurement bases, as well as the geometry of the…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
Arithmetic operations are an important component of many quantum algorithms. As such, coming up with optimized quantum circuits for these operations leads to more efficient implementations of the corresponding algorithms. In this paper, we…
We show that it is possible to reduce the number of two-qubit gates needed for the construction of an arbitrary controlled-unitary transformation by up to two times using a tunable controlled-phase gate. On the platform of linear optics,…
Parallel computation enables multiple processors to execute different parts of a task simultaneously, improving processing speed and efficiency. In quantum computing, parallel gate implementation involves executing gates independently in…
I introduce a new notion, that extends the mutually unbiased bases (MUB) conditons to more than two bases. These, I call the nUB conditions, and the corresponding bases $n$-fold unbiased. They naturally appear while optimizing generic…
There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivities, and coherence times, circuit optimization is essential to make the best use of near-term quantum devices. We introduce…
The paradigm of measurement-based quantum computing (MBQC) starts from a highly entangled resource state on which unitary operations are executed through adaptive measurements and corrections ensuring determinism. This is set in contrast to…
We propose a new scheme of measurement-based quantum computation (MBQC) using an error-correcting code against photon-loss in circuit quantum electrodynamics. We describe a specific protocol of logical single-qubit gates given by sequential…
Quantum computation requires qubits that satisfy often-conflicting criteria, including scalable control and long-lasting coherence. One approach to creating a suitable qubit is to operate in an encoded subspace of several physical qubits.…
In a quantum system having a finite number $N$ of orthogonal states, two orthonormal bases $\{a_i\}$ and $\{b_j\}$ are called mutually unbiased if all inner products $<a_i|b_j>$ have the same modulus $1/\sqrt{N}$. This concept appears in…
In this contribution we group the operator basis for d^2 dimensional Hilbert space in a way that enables us to relate bases of entangled states with single particle mutually unbiased state bases (MUB), each in dimensionality d. We utilize…
Qubits encoded in a decoherence-free subsystem and realized in exchange-coupled silicon quantum dots are promising candidates for fault-tolerant quantum computing. Benefits of this approach include excellent coherence, low control…
The optimal estimation of a quantum mechanical 2-state system (qubit) - with N identically prepared qubits available - is obtained by measuring all qubits simultaneously in an entangled basis. We report the experimental estimation of qubits…
The unextendible orthogonal matrices (UPBs) can be used for various problems in quantum information. We provide an algorithm to check if two UPBs are non-equivalent to each other. We give a method to construct UPBs and we apply this method…
Efficient encoding of classical information plays a fundamental role in numerous practical quantum algorithms. However, the preparation of an arbitrary amplitude-encoded state has been proven to be time-consuming, and its deployment on…
We describe a method for achieving arbitrary 1-qubit gates and controlled-NOT gates within the context of the Single Cooper Pair Box (SCB) approach to quantum computing. Such gates are sufficient to support universal quantum computation.…
We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed…
Quantum modular adders are one of the most fundamental yet versatile quantum computation operations. They help implement functions of higher complexity, such as subtraction and multiplication, which are used in applications such as quantum…
We propose an efficient protocol to fully reconstruct a set of high-fidelity quantum gates. Usually, the efficiency of reconstructing high-fidelity quantum gates is limited by the sampling noise. Our protocol is based on a perturbative…