Related papers: A new local invariant for quantum gates
The physical limitations of quantum hardware often require nearest-neighbor qubit structures, in which two-qubit gates are required to construct nearest-neighbor quantum circuits. However, two-qubit gates are considered a major cost of…
Silicon offers an attractive material platform for hardware realization of quantum computing. In this study, a microscopic stochastic simulation method is developed to model the effect of random interface charge traps in silicon…
Local unitary invariance and the notion of negativity fonts are used as the principle tools to construct four qubit invariants of degree 8, 12, and 24. A degree 8 polynomial invariant that is non-zero on pure four qubit states with…
How to implement multi-qubit gates efficiently with high precision is essential for realizing universal fault tolerant computing. For a physical system with some external controllable parameters, it is a great challenge to control the time…
We analyze and study the effects of locality on the fault-tolerance threshold for quantum computation. We analytically estimate how the threshold will depend on a scale parameter r which estimates the scale-up in the size of the circuit due…
We investigate the characteristics of purely electrostatic interactions with external gates in constructing full single qubit manipulations. The quantum bit is naturally encoded in the spatial wave function of the electron system.…
Scalability of today's superconducting quantum computers is limited due to the huge costs of generating/routing microwave control pulses per qubit from room temperature. One active research area in both industry and academia is to push the…
We present a way for fast implementation of a two-qubit controlled phase gate with superconducting flux qubits coupled to a cavity. A distinct feature of this proposal is that since only qubit-cavity resonant interaction and qubit-pulse…
We study invariants of three-qubit states under local unitary transformations, i.e. functions on the space of entanglement types, which is known to have dimension 6. We show that there is no set of six independent polynomial invariants of…
Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only…
In a topological quantum computer, braids of non-Abelian anyons in a (2+1)-dimensional space-time form quantum gates, whose fault tolerance relies on the topological, rather than geometric, properties of the braids. Here we propose to…
A six-qubit quantum network consisting of conditional unitary gates is presented which is capable of implementing a large class of covariant two-qubit quantum operations. Optimal covariant NOT operations for one and two-qubit systems are…
Tests of local realism vs quantum mechanics based on Bell's inequality employ two entangled qubits. We investigate the general case of two entangled quNits, i.e. quantum systems defined in an N-dimensional Hilbert space. Via a numerical…
We propose a new concept for a two-qubit gate operating on a pair of trapped ions based on laser coherent control techniques. The gate is insensitive to the temperature of the ions, works also outside the Lamb-Dicke regime, requires no…
Uniformly controlled one-qubit gates are quantum gates which can be represented as direct sums of two-dimensional unitary operators acting on a single qubit. We present a quantum gate array which implements any n-qubit gate of this type…
We address the characterization of two-qubit gates, focusing on bounds to precision in the joint estimation of the three parameters that define their Cartan decomposition. We derive the optimal probe states that jointly maximize precision,…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
I discuss how to perform fault-tolerant quantum computation with concatenated codes using local gates in small numbers of dimensions. I show that a threshold result still exists in three, two, or one dimensions when next-to-nearest-neighbor…
We develop a family of quantum accreditation protocols for quantum circuits with non-Clifford two-qubit gates. The latter includes families of gates such as the fSim and XY families of gates, native to existing hardwares. We provide…
We present a family of quantum error-correcting codes that support a universal set of transversal logic gates using only local operations on a two-dimensional array of physical qubits. The construction is a subsystem version of color codes…