相关论文: Pauli webs spun by transversal $|Y\rangle$ state i…

Time-reversal symmetry breaking can enhance or suppress the probability of success for quantum state transfer (QST), and remarkably it can be used to implement the directional QST. In this paper we study the QST on a ring with time-reversal…

In this paper, we explore topological quantum computation augmented by subphases and phase transitions. We commence by investigating the anyon tunneling map, denoted as $\varphi$, between subphases of the quantum double model…

A classification of spanning surfaces for alternating links is provided up to genus, orientability, and a new invariant that we call aggregate slope. That is, given an alternating link, we determine all possible combinations of genus,…

Simplicial versions of topological abelian gauge theories are constructed which reproduce the continuum expressions for the partition function and Wilson expectation value of linked loops, expressible in terms of R-torsion and linking…

Graphical techniques provide a very useful practical device for calculations involving the so-called spin network states, which encode the quantum degrees of freedom of spatial geometry in loop quantum gravity. Graphical calculus of SU(2),…

We present a formalism for Petri nets based on polynomial-style finite-set configurations and etale maps. The formalism supports both a geometric semantics in the style of Goltz and Reisig (processes are etale maps from graphs) and an…

The d-level or qudit one-way quantum computer (d1WQC) is described using the valence bond solid formalism and the generalised Pauli group. This formalism provides a transparent means of deriving measurement patterns for the implementation…

Band inversions are key to stabilising a variety of novel electronic states in solids, from topological surface states in inverted bulk band gaps of topological insulators to the formation of symmetry-protected three-dimensional Dirac and…

In this paper, the degenerate ground states of Z2 topological order on a plane with holes (the so-called surface codes) are used as the protected code subspace to build a topological quantum computer by tuning their quantum tunneling…

We present an entirely 2D transversal realization of phase gates at any level of the Clifford hierarchy, and beyond, using non-Abelian surface codes. Our construction encodes a logical qubit in the quantum double $D(G)$ of a non-Abelian…

We use categorical skew Howe duality to find recursion rules that compute categorified sl(N) invariants of rational tangles colored by exterior powers of the standard representation. Further, we offer a geometric interpretation of these…

We discuss how to use the recent progress in understanding of the $x$-$y$ duality and symplectic duality in the theory of topological recursion and its generalizations in order to efficiently compute the quantum spectral curve operators for…

Analysis of quantum error correcting codes is typically done using a stochastic, Pauli channel error model for describing the noise on physical qubits. However, it was recently found that coherent errors (systematic rotations) on physical…

The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processes and their names can be statically scoped as in the…

We suggest an enhancement to structural coding through the use of (a) causally bound codes, (b) basic constructs of graph theory and (c) statistics. As is the norm with structural coding, the codes are collected into categories. The…

Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…

A quantum error correction code is assessed over its ability to correct errors in noisy quantum circuits. This task requires extensive simulations of faulty quantum circuits, which are often made tractable by considering stochastic Pauli…

A key task in quantum computation is the application of a sequence of gates implementing a specific unitary operation. However, the decomposition of an arbitrary unitary operation into simpler quantum gates is a nontrivial problem. Here we…

We propose a new technique to infer the structure and extract the tokens of data from the semi-structured web sources which are generated using a consistent template or layout with some implicit regularities. The attributes are extracted…

The concrete schemes to realize three types of basic quantum logical gates using linear quadripartite cluster states of optical continuous variables are proposed. The influences of noises and finite squeezing on the computation precision…