Related papers: A note on diagonal gates in SZX-calculus
Calculation aspects of holonomic quantum computer (HQC) are considered. Wilczek--Zee potential defining the set of quantum calculations for HQC is explicitly evaluated. Principal possibility of realization of the logical gates for this case…
Different graphical calculi have been proposed to represent quantum computation. First the ZX- calculus [4], followed by the ZW-calculus [12] and then the ZH-calculus [1]. We can wonder if new Z*-calculi will continue to be proposed…
Matchgates are a restricted set of two-qubit gates known to be classically simulable when acting on nearest-neighbor qubits on a path, but universal for quantum computation when the qubits are arranged on certain other graphs. Here we…
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,…
In this article the elementary gates for ternary quantum logic circuit are studied. We propose the ternary controlled X (TCX) gate or ternary controlled Z (TCZ) gate as two-qutrit elementary gate, which is universal when assisted by…
The ZX-Calculus is a graphical language for quantum mechanics. An axiomatisation has recently been proven to be complete for an approximatively universal fragment of quantum mechanics, the so-called Clifford+T fragment. We focus here on the…
Geometric and holonomic quantum computation utilizes intrinsic geometric properties of quantum-mechanical state spaces to realize quantum logic gates. Since both geometric phases and quantum holonomies are global quantities depending only…
In the first part of this review we introduce the basics theory behind geometric phases and emphasize their importance in quantum theory. The subject is presented in a general way so as to illustrate its wide applicability, but we also…
Certain types of quantum computing platforms, such as those realized using Rydberg atoms or Kerr-cat qubits, are natively more susceptible to Pauli-Z noise than Pauli-X noise, or vice versa. On such hardware, it is useful to ensure that…
Much recent work on distributed quantum computing have focused on the use of entangled pairs and distributed two qubit gates. But there has also been work on efficient schemes for achieving multipartite entanglement between nodes in a…
In 2008 Coecke and Duncan proposed the graphical ZX-calculus rewrite system which came to formalize reasoning with quantum circuits, measurements and quantum states. The ZX-calculus is sound for qubit quantum mechanics. Hence, equality of…
I describe the use of techniques based on composite rotations to combat systematic errors in controlled phase gates, which form the basis of two qubit quantum logic gates. Although developed and described within the context of Nuclear…
We introduce a new family of models for measurement-based quantum computation which are deterministic and approximately universal. The resource states which play the role of graph states are prepared via 2-qubit gates of the form…
This paper is an introduction to diagrammatic methods for representing quantum processes and quantum computing. We review basic notions for quantum information and quantum computing. We discuss topological diagrams and some issues about…
The performance of a quantum information processor depends on the precise control of phases introduced into the system during quantum gate operations. As the number of operations increases with the complexity of a computation, the phases of…
A quantum computing simulation provides the opportunity to explore the behaviors of quantum circuits, study the properties of quantum gates, and develop quantum computing algorithms. Simulating quantum circuits requires geometric time and…
Silicon-based quantum computing has the potential advantages of low cost, high integration density, and compatibility with CMOS technologies. The detuning mechanism has been used to experimentally achieve silicon two-qubit quantum gates and…
Systematic discovery of optimization paths in quantum circuit simplification remains a challenge. Today, ZX-calculus, a computing model for quantum circuit transformation, is attracting attention for its highly abstract graph-based…
This note reviews prospects for quantum computing. It argues that gates need to be tested for a wide range of probability amplitudes.
Given an arbitrary $2^w \times 2^w$ unitary matrix $U$, a powerful matrix decomposition can be applied, leading to four different syntheses of a $w$-qubit quantum circuit performing the unitary transformation. The demonstration is based on…