Related papers: Diagonal-unitary 2-designs and their implementatio…

Local random circuits scramble efficiently and accordingly have a range of applications in quantum information and quantum dynamics. With a global $U(1)$ charge however, the scrambling ability is reduced; for example, such random circuits…

We present a new set of generators for unitary maps over \otimes^n(C^2) which differs from the traditional rotation-based generating set in that it uses a single-parameter family of 1-qubit unitaries J(a), together with a single 2-qubit…

Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates. However, as circuit depth and gate number increase, gate imperfections and qubit decoherence…

Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…

Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…

Superconducting qubits are a promising candidate for building a quantum computer. A continued challenge for fast yet accurate gates to minimize the effects of decoherence. Here we apply numerical methods to design fast entangling gates,…

Implementations for quantum computing require fast single- and multi-qubit quantum gate operations. In the case of optically controlled quantum dot qubits theoretical designs for long-range two- or multi-qubit operations satisfying all the…

Nonlocal properties of an ensemble of diagonal random unitary matrices of order $N^2$ are investigated. The average Schmidt strength of such a bipartite diagonal quantum gate is shown to scale as $\log N$, in contrast to the $\log N^2$…

We propose a universal gate set for quantum computing with all-to-all connectivity and intrinsic robustness to bit-flip errors based on parity encoding. We show that logical controlled phase gate and $R_z$ rotations can be implemented in…

Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing. Efficient optimal methods are known for single-qubit RZ unitaries, otherwise…

Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…

Just how fast does the brickwork circuit form an approximate 2-design? Is there any difference between anticoncentration and being a 2-design? Does geometry matter? How deep a circuit will I need in practice? We tell you everything you…

We theoretically study single and two-qubit dynamics in the circuit QED architecture. We focus on the current experimental design [Wallraff et al., Nature 431, 162 (2004); Schuster et al., Nature 445, 515 (2007)] in which superconducting…

A quantum circuit is generalized to a nonunitary one whose constituents are nonunitary gates operated by quantum measurement. It is shown that a specific type of one-qubit nonunitary gates, the controlled-NOT gate, as well as all one-qubit…

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…

Photonic quantum computing offers a promising platform for quantum information processing, benefiting from the long coherence times of photons and their ease of manipulation. This paper presents a scheme for implementing a deterministic…

Since the final quantum state in the Grover search algorithm is the normalized marked quantum state from the Gram-Schmidt process, Abrams and Lloyd [1] has shown that we can generate this vector by using a non-unitary gate. Following their…

We consider quantum circuit models where the gates are drawn from arbitrary gate ensembles given by probabilistic distributions over certain gate sets and circuit architectures, which we call stochastic quantum circuits. Of main interest in…

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…