相关论文: Supplementarity is Necessary for Quantum Diagram R…

We present a system of equations between Clifford circuits, all derivable in the ZX-calculus, and formalised as rewrite rules in the Quantomatic proof assistant. By combining these rules with some non-trivial simplification procedures…

Many conjectures and open problems in graph theory can either be reduced to cubic graphs or are directly stated for cubic graphs. Furthermore, it is known that for a lot of problems, a counterexample must be a snark, i.e. a bridgeless cubic…

Berry phases and the quantum-information theoretic notion of fidelity have been recently used to analyze quantum phase transitions from a geometrical perspective. In this paper we unify these two approaches showing that the underlying…

Quantum error correction is an important ingredient for scalable quantum computing. Stabilizer codes are one of the most promising and straightforward ways to correct quantum errors, are convenient for logical operations, and improve…

The Scalable ZX-calculus is a compact graphical language used to reason about linear maps between quantum states. These diagrams have multiple applications, but they frequently have to be constructed in a case-by-case basis. In this work we…

In this paper, we develop the theory of Jacobian rings of open complete intersections, which mean a pair $(X,Z)$ where $X$ is a smooth complete intersection in the projective space and and $Z$ is a simple normal crossing divisor in $X$…

Some recent works have introduced a quantum twist to the concept of complementarity, exemplified by a setup in which the which-way detector is in a superposition of being present and absent. It has been argued that such experiments allow…

We introduce the fermionic ZW calculus, a string-diagrammatic language for fermionic quantum computing (FQC). After defining a fermionic circuit model, we present the basic components of the calculus, together with their interpretation, and…

Analyzing and developing new quantum error-correcting schemes is one of the most prominent tasks in quantum computing research. In such efforts, introducing time dynamics explicitly in both analysis and design of error-correcting protocols…

In this short note, we consider the conjecture that the log canonical divisor (resp. the anti-log canonical divisor) $K_X + \Delta$ (resp. $-(K_X + \Delta)$) on a pair $(X, \Delta)$ consisting of a complex projective manifold $X$ and a…

We review a notion of completeness in QFT arising from the analysis of basic properties of the set of operator algebras attached to regions. In words, this completeness asserts that the physical observable algebras produced by local degrees…

Categorical quantum mechanics studies quantum theory in the framework of dagger-compact closed categories. Using this framework, we establish a tight relationship between two key quantum theoretical notions: non-locality and…

There are several models of quantum computation which exhibit shared fundamental fault-tolerance properties. This article makes commonalities explicit by presenting these different models in a unifying framework based on the ZX calculus. We…

In this paper, we are motivated by two conjectures proposed by C. Bender et al.\ in 2024, which have remained open questions. The first conjecture states that if the complemented zero-divisor graph \( G(S) \) of a commutative semigroup \( S…

The quantum cohomology algebra of a projective manifold X is the cohomology H(X,Q) endowed with a different algebra structure, which takes into account the geometry of rational curves in X. We show that this algebra takes a remarkably…

The history of complementary observables and mutual unbiased bases is reviewed. A characterization is given in terms of conditional entropy of subalgebras. The concept of complementarity is extended to non-commutative subalgebras.…

In the field of non-equilibrium phase transitions, the Kibble-Zurek mechanism (KZM) is undoubtedly an important discovery, pointing out that some universal scaling rules are applied to a wide range of physical systems from quantum to the…

Classical program analysis techniques, such as abstract interpretation and symbolic execution, are essential for ensuring software correctness, optimizing performance, and enabling compiler optimizations. However, these techniques face…

In this paper, we study the structure of cyclic, quasi-cyclic, constacyclic codes and their skew codes over the finite ring R=Z_3+vZ_3+v^2Z_3, v^3=v. The Gray images of cyclic, quasi-cyclic, skew cyclic, skew quasi-cyclic and skew…

Deconfined quantum criticality (DQC) arises from fractionalization of quasi-particles and leads to fascinating behaviors beyond the Landau-Ginzburg-Wilson description of phase transitions. Here, we study the critical dynamics when driving a…