相关论文: Robust Logic Gates and Realistic Quantum Computati…

Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of gates: error gates from the general Pauli group P and…

The work proposes an extension of the quantum circuit formalism where qubits (wires) are circular instead of linear. The left-to-right interpretation of a quantum circuit is replaced by a circular representation which allows to select the…

Fastness and robustness are both critical in the implementation of high-fidelity gates for quantum computation, but in practice, a trade-off has to be made between them. In this paper, we investigate the underlying robust time-optimal…

A rotation-based synthesis framework for reversible logic is proposed. We develop a canonical representation based on binary decision diagrams and introduce operators to manipulate the developed representation model. Furthermore, a…

Hybrid quantum systems combine the unique advantages of different physical platforms with the goal of realizing more powerful and practical quantum information processing devices. Mechanical systems, such as bulk acoustic wave resonators,…

Composite pulses provide a simple means for constructing quantum logic gates which are robust to small errors in the control fields used to implement them. Here I describe how antisymmetric composite NOT gates can be nested to produce gates…

We propose a method for quantum information processing using molecules coupled to an external laser field. This utilizes molecular interactions, control of the external field and an effective energy shift of the doubly-excited state of two…

We propose a method to construct composite two-qubit gates with narrowband profiles with respect to the spin-spin coupling. The composite sequences are selective to the variations in the amplitude and duration of the spin-spin coupling, and…

Characterization of experimental systems is an essential step in developing and improving quantum hardware. A collection of protocols known as Randomized Benchmarking (RB) was developed in the past decade, which provides an efficient way to…

We propose a new way of implementing several elementary quantum gates for qubits in the coherent state basis. The operations are probabilistic and employ single photon subtractions as the driving force. Our schemes for single-qubit phase…

Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computation with constant overhead. Recent advancements have shown that qLDPC codes can outperform the quantum memory capability of…

In this work we propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count very close to the current theoretical lower bounds. In particular, it turns…

For circuit-based quantum computation, experimental implementation of universal set of quantum logic gates with high-fidelity and strong robustness is essential and central. Quantum gates induced by geometric phases, which depend only on…

This study presents a roadmap towards utilizing a single arbitrary gate for universal quantum computing. Since two decades ago, it has been widely accepted that almost any single arbitrary gate with qubit number $>2$ is universal. Utilizing…

Quantum computation provides great speedup over its classical counterpart for certain problems. One of the key challenges for quantum computation is to realize precise control of the quantum system in the presence of noise. Control of the…

Quantum computation requires many qubits that can be coherently controlled and coupled to each other. Qubits that are defined using lithographic techniques are often argued to be promising platforms for scalability, since they can be…

We propose an approach to optimally synthesize quantum circuits from non-permutative quantum gates such as Controlled-Square-Root-of-Not (i.e. Controlled-V). Our approach reduces the synthesis problem to multiple-valued optimization and…

A clever choice and design of gate sets can reduce the depth of a quantum circuit, and can improve the quality of the solution one obtains from a quantum algorithm. This is especially important for near-term quantum computers that suffer…

A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from…

We consider quantum computer architectures where interactions are mediated between hot qubits that are not in their mechanical ground state. Such situations occur, e.g., when not cooling ideally, or when moving ions or atoms around. We…