Related papers: Logarithmic Depth Decomposition of Approximate Mul…
A quantum state transformation can be generally approximated by single- and two-qubit gates. This, however, does not hold with noisy intermediate-scale quantum technologies due to the errors appearing in the gate operations, where errors of…
Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum algorithms can be compiled and implemented on such…
In this paper we show that it is possible to adapt a qudit scheme for creating a controlled-Toffoli created by Ralph et al. [Phys. Rev. A 75 011213] to be applicable to qubits. While this scheme requires more gates than standard schemes for…
Higher-dimensional quantum systems (qudits) offer advantages in information encoding, error resilience, and compact gate implementations, and naturally arise in platforms such as superconducting and solid-state systems. However, realistic…
Quantum error correction (QEC) requires the execution of deep quantum circuits with large numbers of physical qubits to protect information against errors. Designing protocols that can reduce gate and space-time overheads of QEC is…
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…
Rapid development in quantum computing leads to the appearance of several quantum applications. Quantum Fourier Transformation (QFT) sits at the heart of many of these applications. Existing work leverages SAT solver or heuristics to…
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,…
In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence…
The optimal cost of a three-qubit Fredkin gate is 5 two-qubit entangling gates, and the overhead climbs to 8 when restricted to controlled-not (CNOT) gates. By harnessing higher-dimensional Hilbert spaces, we reduce the cost of a…
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…
We propose a new algorithm to synthesise quantum circuits for phase polynomials, which takes into account the qubit connectivity of the quantum computer. We focus on the architectures of currently available NISQ devices. Our algorithm…
Mapping logical quantum circuits to Noisy Intermediate-Scale Quantum (NISQ) devices is a challenging problem which has attracted rapidly increasing interests from both quantum and classical computing communities. This paper proposes an…
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 introduce an open source software package UniversalQCompiler written in Mathematica that allows the decomposition of arbitrary quantum operations into a sequence of single-qubit rotations (with arbitrary rotation angles) and…
Quantum gates based on geometric phases possess intrinsic noise-resilience features and therefore attract much attention. However, the implementations of previous geometric quantum computation typically require a long pulse time of gates.…
This work proposes numerical tests which determine whether a two-qubit operator has an atypically simple quantum circuit. Specifically, we describe formulae, written in terms of matrix coefficients, characterizing operators implementable…
Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity,…
The resource overhead required to achieve net computational benefits from quantum error correction (QEC) limits its utility while current systems remain constrained in size, despite exceptional progress in experimental demonstrations. In…
In this paper, we describe and experimentally demonstrate an error detection scheme that does not employ ancilla qubits or mid-circuit measurements. This is achieved by expanding the Hilbert space where a single logical qubit is encoded…