Related papers: Hardware-Tailored Diagonalization Circuits
Quantum logic decomposition refers to decomposing a given quantum gate to a set of physically implementable gates. An approach has been presented to decompose arbitrary diagonal quantum gates to a set of multiplexed-rotation gates around z…
Randomized benchmarking is a powerful technique to efficiently estimate the performance and reliability of quantum gates, circuits and devices. Here we propose to perform randomized benchmarking in a coherent way, where superpositions of…
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…
Scaling quantum computers, i.e., quantum processing units (QPUs) to enable the execution of large quantum circuits is a major challenge, especially for applications that should provide a quantum advantage over classical algorithms. One…
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term…
Distributed quantum computing is motivated by the difficulty in building large-scale, individual quantum computers. To solve that problem, a large quantum circuit is partitioned and distributed to small quantum computers for execution.…
Decomposing unitary operations into native gates is an essential step for implementing quantum algorithms. For qubit-based devices, where native gates are typically single- and two-qubit operations, a range of decomposition techniques have…
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
Variational quantum algorithms (VQAs) for combinatorial optimization routinely employ entangling gates as a default design choice, yet the role of entanglement, in its amount and structure, remains poorly understood. This gap is…
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…
Constructing general programmable circuits to be able to run any given unitary operator efficiently on a quantum processor is of fundamental importance. We present a new quantum circuit design technique resulting two general programmable…
Practical applicability of quantum optimisation on near term devices is constrained by limited qubit counts and hardware noise, which restricts the scalability of quantum optimisation algorithms for combinatorial problems. The simulation of…
An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single…
Holonomic quantum computation exploits the geometric evolution of eigenspaces of a degenerate Hamiltonian to implement unitary evolution of computational states. In this work we introduce a framework for performing scalable quantum…
Scaling up quantum computing hardware is hindered by the narrow operating margins of current quantum components. Here, we introduce a composite qubit and gate scheme that achieves wide margins by use of transistor-like nonlinearities to…
We propose an algorithm for variational quantum algorithms (VQAs) to optimize the structure of parameterized quantum circuits (PQCs) efficiently. The algorithm optimizes the PQC structure on-the-fly in VQA by sequentially replacing a…
Quantum error correction is instrumental in protecting quantum systems from noise in quantum computing and communication settings. Pauli channels can be efficiently simulated and threshold values for Pauli error rates under a variety of…
Decoherence of quantum hardware is currently limiting its practical applications. At the same time, classical algorithms for simulating quantum circuits have progressed substantially. Here, we demonstrate a hybrid framework that integrates…
We argue that the analog nature of quantum computing makes the usual design approach of constructing complicated logical operations from many simple gates inappropriate. Instead, we propose to design multi-spin quantum gates in which the…
In many practical applications, quantum algorithms require several qubits, significantly more than those available with current noisy intermediate-scale quantum processors. Distributed quantum computing (DQC) is considered a scalable…