Related papers: Pauli webs spun by transversal $|Y\rangle$ state i…
Typical studies of quantum error correction assume probabilistic Pauli noise, largely because it is relatively easy to analyze and simulate. Consequently, the effective logical noise due to physically realistic coherent errors is relatively…
Transversal implementations of encoded unitary gates are highly desirable for fault-tolerant quantum computation. Though transversal gates alone cannot be computationally universal, they can be combined with specially distilled resource…
Transversal gates play a crucial role in suppressing error propagation in fault-tolerant quantum computation, yet they are intrinsically constrained: any nontrivial code encoding a single logical qubit admits only a finite subgroup of…
A central building block of many quantum algorithms is the diagonalization of Pauli operators. Although it is always possible to construct a quantum circuit that simultaneously diagonalizes a given set of commuting Pauli operators, only…
The reversible implementation of classical functions accounts for the bulk of most known quantum algorithms. As a result, a number of reversible circuit constructions over the Clifford+$T$ gate set have been developed in recent years which…
We construct a new family of permutationally invariant codes that correct $t$ Pauli errors for any $t\ge 1$. We also show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction…
We provide a purely quantum version of polar codes, achieving the symmetric coherent information of any qubit-input quantum channel. Our scheme relies on a recursive channel combining and splitting construction, where a two-qubit gate…
A set of Pauli stings is well characterized by the graph that encodes its commutatitivity structure, i.e., by its frustration graph. This graph provides a natural interface between graph theory and quantum information, which we explore in…
We derive the Pauli equation for a charged spin particle confined to move on a spatially curved surface $\mathcal{S}$ in an electromagnetic field. Using the thin-layer quantization scheme to constrain the particle on $\mathcal{S}$, and in…
Surface codes are quantum error correcting codes normally defined on 2D arrays of qubits. In this paper, we introduce a surface code design based on the fact that the severity of bit flip and phase flip errors in the physical quantum…
In this paper we discuss a proposal of coherent states for Loop Quantum Gravity. These states are labeled by a point in the phase space of General Relativity as captured by a spin-network graph. They are defined as the gauge invariant…
We extend the $sl(3)$-polynomial invariant for links to tangles. Motivated by Kuperberg's construction of this invariant via planar trivalent graphs, we first define a category of $sl(3)$ webs and its sister linear category, and describe…
In the implementation of quantum information systems, one type of Pauli error, such as phase-flip errors, may occur more frequently than others, like bit-flip errors. For this reason, quantum error-correcting codes that handle asymmetric…
Spin network systems can be used to achieve quantum state transfer with high fidelity and to generate entanglement. A new approach to design spin-chain-based spin network systems, for shortrange quantum information processing and…
The variational quantum algorithms are crucial for the application of NISQ computers. Such algorithms require short quantum circuits, which are more amenable to implementation on near-term hardware, and many such methods have been…
Pauli blockade mechanisms -- whereby carrier transport through quantum dots is blocked due to selection rules even when energetically allowed -- are a direct manifestation of the Pauli exclusion principle, as well as a key mechanism for…
Classical methods to simulate quantum systems are not only a key element of the physicist's toolkit for studying many-body models but are also increasingly important for verifying and challenging upcoming quantum computers. Pauli…
We demonstrate an optical gate that increases the size of polarization-based W states by accessing only one of the qubits. Using this gate, we have generated three-photon and four-photon W states with fidelities $0.836\pm 0.042 $ and…
The notion of 'slope rational connectedness' is introduced in the context of smooth orbifold pairs. The main result parallels the characterization of the rational connectedness of projective manifolds in terms of either the non-existence of…
Webs give a diagrammatic calculus for spaces of tensor invariants. We introduce hourglass plabic graphs as a new avatar of webs, and use these to give the first rotation-invariant $U_q(\mathfrak{sl}_4)$-web basis, a long-sought object. The…