Related papers: Implementation of a quantum addressable router usi…
A possible building block for a scalable quantum computer has recently been demonstrated [M. Mariantoni et al., Science 334, 61 (2011)]. This architecture consists of superconducting qubits capacitively coupled both to individual memory…
We propose a hybrid quantum system consisting of a magnetic particle inductively coupled to two superconducting transmon qubits, where qubit-qubit interactions are mediated via magnons. We show that the system can be tuned into three…
Quantum computing promises to solve previously intractable problems, with neutral atoms emerging as a promising technology. Zoned neutral atom architectures allow for immense parallelism and higher coherence times by shielding idling atoms…
Quantum Key Distribution (QKD) networks enable unconditionally secure key exchange using quantum mechanical principles. However, routing cryptographic keys across multi-hop quantum networks introduces challenges unique to quantum…
The design of coupler-based superconducting two-qubit gates simplifies circuit layout and alleviate frequency crowding, thereby enhancing the scalability and flexibility of quantum chips. However, in such architectures, a trade-off often…
Two different models for performing efficiently routing of a quantum state are presented. Both cases involve an XX spin chain working as data bus and additional spins that play the role of sender and receivers, one of which is selected to…
With recent improvements in coherence times, superconducting transmon qubits have become a promising platform for quantum computing. They can be flexibly engineered over a wide range of parameters, but also require us to identify an…
In the present paper methods and algorithms of modeling quantum operations for quantum computer integrated circuits design are developed. We examine different ways of quantum operation descriptions, including operator-sums, unitary…
We introduce a simple, widely applicable formalism for designing "error-divisible" two qubit gates: a quantum gate set where fractional rotations have proportionally reduced error compared to the full entangling gate. In current noisy…
Quantum algorithms can be realized in the form of a quantum circuit. To map quantum circuit for specific quantum algorithm to quantum hardware, qubit mapping is an imperative technique based on the qubit topology. Due to the neighbourhood…
Quantum error correction will be a necessary component towards realizing scalable quantum computers with physical qubits. Theoretically, it is possible to perform arbitrarily long computations if the error rate is below a threshold value.…
Two of the major obstacles to achieve quantum computing (QC) are (i) scalability to many qubits and (ii) controlled connectivity between any selected qubits. Using Josephson charge qubits, here we propose an experimentally realizable method…
Scalable superconducting quantum processors require balancing critical constraints in coherence, control complexity, and spectral crowding. Fixed-frequency architectures suppress flux noise and simplify control via all-microwave operations…
Using geometric phases to realize noise-resilient quantum computing is an important method to enhance the control fidelity. In this work, we experimentally realize a universal nonadiabatic geometric quantum gate set in a superconducting…
The primary objective of this paper is to present an exact and general procedure for mapping any sequence of quantum gates onto a network of probabilistic p-bits which can take on one of two values 0 and 1. The first $n$ p-bits represent…
The cross-resonant gate is an entangling gate for fixed frequency superconducting qubits introduced for untunable qubits. While being simple and extensible, it suffers from long duration and limited fidelity. Using two different optimal…
Achieving fast and high-fidelity qubit operations is crucial for unlocking the potential of quantum computers. In particular, reaching low gate errors in two-qubit gates has been a long-standing challenge in the field of superconducting…
Quantum Random Walks, which have drawn much attention over the past few decades for their distinctly non-classical behavior, is a promising subfield within Quantum Computing. Theoretical framework and applications for these walks have seen…
We introduce an approach to quantum information processing where the information is stored in the motional degrees of freedom of nanomechanical devices. The qubits of our approach are formed by the two lowest energy levels of mechanical…
A quantum circuit transformation (QCT) is required when executing a quantum program in a real quantum processing unit (QPU). Through inserting auxiliary SWAP gates, a QCT algorithm transforms a quantum circuit to one that satisfies the…