相关论文: Generalized Complexity Distances and Non-Invertibl…
The required absence of global symmetries in quantum gravity has been used to imply that all non-compact gauge theories are in the swampland. This argument stems from the idea that non-compact gauge symmetries always seem to be accompanied…
The computational complexity of a quantum state quantifies how hard it is to make. `Complexity geometry', first proposed by Nielsen, is an approach to defining computational complexity using the tools of differential geometry. Here we…
We investigate up to which extend the kinematic setting of loop quantum gravity can be fit into a diffeomorphism invariant setting of algebraic QFT generalizing the Haag-Kastler setting of Wightman type QFT. The net of local (Weyl-)algebras…
We sketch a procedure to capture general non-invertible symmetries of a d-dimensional quantum field theory in the data of a higher-category, which captures the local properties of topological defects associated to the symmetries. We also…
In this letter we use the Anti-de Sitter/Conformal Field Theory (AdS/CFT) correspondence to establish a set of old conjectures about symmetries in quantum gravity. These are that no global symmetries are possible, that internal gauge…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
The implementation of physical symmetries into problem descriptions allows for the reduction of parameters and computational complexity. We show the integration of the permutation symmetry as the most restrictive discrete symmetry into…
A quantum circuit is generalized to a nonunitary one whose constituents are nonunitary gates operated by quantum measurement. It is shown that a specific type of one-qubit nonunitary gates, the controlled-NOT gate, as well as all one-qubit…
This paper presents the generalization of weighted distances to modules and their computation through the chamfer algorithm on general point lattices. The first part is dedicated to formalization of definitions and properties (distance,…
We study 3d and 4d systems with a one-form global symmetry, explore their consequences, and analyze their gauging. For simplicity, we focus on $\mathbb{Z}_N$ one-form symmetries. A 3d topological quantum field theory (TQFT) $\mathcal{T}$…
We present the case for a fundamentally discrete quantum spacetime and for Group Field Theories as a candidate consistent description of it, briefly reviewing the key properties of the GFT formalism. We then argue that the outstanding…
We introduce a framework for internal topological symmetries in quantum field theory, including "noninvertible symmetries" and "categorical symmetries". This leads to a calculus of topological defects which takes full advantage of…
We find that different asymptotic measurements in quantum field theory can be related to one another through new versions of crossing symmetry. Assuming analyticity, we conjecture generalized crossing relations for multi-particle processes…
How to find universal sets quantum gates (gates whose composition can form any othergate within a given range) is an important part of the development of quantum computation science that has been explored in the past with success. However,…
Matchgates are a group of two-qubit gates associated with free fermions. They are classically simulatable if restricted to act between nearest neighbors on a one-dimensional chain, but become universal for quantum computation with…
The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The…
We introduce a family of highly symmetric bipartite quantum states in arbitrary dimensions. It consists of all states that are invariant under local phase rotations and local cyclic permutations of the basis. We solve the separability…
We develop a general framework for studying phases of mixed states with strong and weak symmetries, including non-invertible or categorical symmetries. The central idea is to consider a purification of the mixed state density matrix, which…
The big challenge in quantum computing is to realize scalable multi-qubit systems with cross-talk free addressability and efficient coupling of arbitrarily selected qubits. Quantum networks promise a solution by integrating smaller qubit…
We study the non-invertible symmetries of class $\mathcal{S}$ theories obtained by compactifying the type $\mathfrak{a}_{p-1}$ 6d (2,0) theory on a genus $g$ Riemann surface with no punctures. After setting up the general framework, we…