Related papers: Modularized and Scalable Compilation for Double Qu…
We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically…
Quantum compiling fills the gap between the computing layer of high-level quantum algorithms and the layer of physical qubits with their specific properties and constraints. Quantum compiling is a hybrid between the general-purpose…
A quantum computer consists of a set of quantum bits upon which operations called gates are applied to perform computations. In order to perform quantum algorithms, physicists would like to design arbitrary gates to apply to quantum bits.…
Superconducting qubits provide a promising approach to large-scale fault-tolerant quantum computing. However, qubit connectivity on a planar surface is typically restricted to only a few neighboring qubits. Achieving longer-range and more…
We introduce a novel strategy, based on the use of modular variables, to encode and deterministically process quantum information using states described by continuous variables. Our formalism leads to a general recipe to adapt existing…
Processing quantum information using quantum three-level systems or qutrits as the fundamental unit is an alternative to contemporary qubit-based architectures with the potential to provide significant computational advantages. We…
Variational quantum algorithms have emerged as a powerful tool for harnessing the potential of near-term quantum devices to address complex challenges across quantum science and technology. Yet, the robust and scalable quantification of…
We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…
Quantum hardware development is progressing rapidly with substantial advancements achieved across leading platforms, including superconducting circuits, trapped-ion systems, and neutral atom arrays. As the pursuit of practical quantum…
Quantum compilation is the process of converting a target unitary operation into a trainable unitary represented by a quantum circuit. It has a wide range of applications, including gate optimization, quantum-assisted compiling, quantum…
Quantum dynamics compilation is an important task for improving quantum simulation efficiency: It aims to synthesize multi-qubit target dynamics into a circuit consisting of as few elementary gates as possible. Compared to deterministic…
Connecting multiple smaller qubit modules by generating high-fidelity entangled states is a promising path for scaling quantum computing hardware. The performance of such a modular quantum computer is highly dependent on the quality and…
To implement quantum algorithms on a quantum computer, we must overcome the twin problems of fault-tolerance -- how can we realize a relatively noiseless computation by cleverly combining noisy components? -- and compilation -- how can we…
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…
Adaptive construction of ansatz circuits offers a promising route towards applicable variational quantum eigensolvers on near-term quantum hardware. Those algorithms aim to build up optimal circuits for a certain problem and ansatz circuits…
We present a novel set of reversible modular multipliers applicable to quantum computing, derived from three classical techniques: 1) traditional integer division, 2) Montgomery residue arithmetic, and 3) Barrett reduction. Each multiplier…
Implementation of logical entangling gates is an important step towards realizing a quantum computer. We use a gradient-based optimization approach to find single-qubit rotations which can be interleaved between applications of a noisy…
Here we show how universal quantum computers based on the quantum circuit model can handle mathematical analysis calculations for functions with continuous domains, without any digitalization, and with remarkably few qubits. The basic…
A matrix can be converted into a doubly stochastic matrix by using two diagonal matrices. And a doubly stochastic matrix can be written as a sum of permutation matrices. In this paper, we describe a method to write a given generic matrix in…
We propose an effective realization of a complete set of elementary quantum gates in the solid-state quantum computer based on the multi-atomic coherent (MAC-) ensembles in the QED cavity. Here, we use the two-ensemble qubit encoding and…