Related papers: On group theory for quantum gates and quantum cohe…
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…
Symmetry groups are projectively represented in quantum mechanics, and crystalline symmetries are fundamental in condensed matter physics. Here, we systematically present a unified theory of quantum mechanical space groups from two…
We use quantum process tomography to characterize a full universal set of all-microwave gates on two superconducting single-frequency single-junction transmon qubits. All extracted gate fidelities, including those for Clifford group…
Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure…
The Clifford+T gate set is a topological generating set for PU(2), which has been well-studied from the perspective of quantum computation on a single qubit. The discovery that it generates a full S-arithmetic subgroup of PU(2) has led to a…
Group twirling is crucial in quantum information processing, particularly in randomized benchmarking and random compiling. While protocols based on Pauli twirling have been effectively crafted to transform arbitrary noise channels into…
Clifford group lies at the core of quantum computation -- it underlies quantum error correction, its elements can be used to perform magic state distillation and they form randomized benchmarking protocols, Clifford group is used to study…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…
Mathematical core of quantum mechanics is the theory of unitary representations of symmetries of physical systems. We argue that quantum behavior is a natural result of extraction of "observable" information about systems containing…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
We present a discussion of the generalized Clifford group over non-cyclic finite abelian groups. These Clifford groups appear naturally in the theory of topological error correction and abelian anyon models. We demonstrate a generalized…
Superconducting quantum circuit is a promising system for building quantum computer. With this system we demonstrate the universal quantum computations, including the preparing of initial states, the single-qubit operations, the two-qubit…
The Clifford group is a fundamental structure in quantum information with a wide variety of applications. We discuss the tensor representations of the $q$-qubit Clifford group, which is defined as the normalizer of the $q$-qubit Pauli group…
We examine the following problem: given a collection of Clifford gates, describe the set of unitaries generated by circuits composed of those gates. Specifically, we allow the standard circuit operations of composition and tensor product,…
Group theory is extremely successful in characterizing the symmetries in quantum systems, which greatly simplifies and unifies our treatments of quantum systems. Here we introduce the concept of the symmetry for a quantum Boltzmann machine…
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however…
We describe the notion of a quantum family of maps of a quantum space and that of a quantum commutant of such a family. Quantum commutants are quantum semigroups defined by a certain universal property. We give a few examples of these…
(Abridged abstract.) In this thesis we introduce new models of quantum computation to study the emergence of quantum speed-up in quantum computer algorithms. Our first contribution is a formalism of restricted quantum operations, named…
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the…
Fault-tolerant quantum computing hinges on efficient logical compilation, in particular, translating high-level circuits into code-compatible implementations. Gate-by-gate compilation often yields deep circuits, requiring significant…