scholarly journals Stabilizer states and Clifford operations for systems of arbitrary dimensions and modular arithmetic

2005 ◽  
Vol 71 (4) ◽  
Author(s):  
Erik Hostens ◽  
Jeroen Dehaene ◽  
Bart De Moor
2021 ◽  
Vol 2021 (5) ◽  
Author(s):  
Gökhan Alkaç ◽  
Mehmet Kemal Gümüş ◽  
Mustafa Tek

Abstract The Kerr-Schild double copy is a map between exact solutions of general relativity and Maxwell’s theory, where the nonlinear nature of general relativity is circumvented by considering solutions in the Kerr-Schild form. In this paper, we give a general formulation, where no simplifying assumption about the background metric is made, and show that the gauge theory source is affected by a curvature term that characterizes the deviation of the background spacetime from a constant curvature spacetime. We demonstrate this effect explicitly by studying gravitational solutions with non-zero cosmological constant. We show that, when the background is flat, the constant charge density filling all space in the gauge theory that has been observed in previous works is a consequence of this curvature term. As an example of a solution with a curved background, we study the Lifshitz black hole with two different matter couplings. The curvature of the background, i.e., the Lifshitz spacetime, again yields a constant charge density; however, unlike the previous examples, it is canceled by the contribution from the matter fields. For one of the matter couplings, there remains no additional non-localized source term, providing an example for a non-vacuum gravity solution corresponding to a vacuum gauge theory solution in arbitrary dimensions.


2020 ◽  
Vol 2 (4) ◽  
Author(s):  
Ninnat Dangniam ◽  
Yun-Guang Han ◽  
Huangjun Zhu
Keyword(s):  

2020 ◽  
pp. 2050336
Author(s):  
A. Belhaj ◽  
Y. El Maadi ◽  
S-E. Ennadifi ◽  
Y. Hassouni ◽  
M. B. Sedra

Motivated by particle physics results, we investigate certain dyonic solutions in arbitrary dimensions. Concretely, we study the stringy constructions of such objects from concrete compactifications. Then, we elaborate their tensor network realizations using multistate particle formalism.


1990 ◽  
Vol 21 (2) ◽  
pp. 1-10
Author(s):  
Toshiro Tachibana ◽  
Hideo Nakano ◽  
Yoshiro Nakanishi ◽  
Mitsuru Nakao

2003 ◽  
Vol 18 (30) ◽  
pp. 5541-5612 ◽  
Author(s):  
F. ANSELMO ◽  
J. ELLIS ◽  
D. V. NANOPOULOS ◽  
G. VOLKOV

We present a universal normal algebra suitable for constructing and classifying Calabi–Yau spaces in arbitrary dimensions. This algebraic approach includes natural extensions of reflexive weight vectors to higher dimensions, related to Batyrev's reflexive polyhedra, and their n-ary combinations. It also includes a "dual" construction based on the Diophantine decomposition of invariant monomials, which provides explicit recurrence formulae for the numbers of Calabi–Yau spaces in arbitrary dimensions with Weierstrass, K3, etc., fibrations. Our approach also yields simple algebraic relations between chains of Calabi–Yau spaces in different dimensions, and concrete visualizations of their singularities related to Cartan–Lie algebras. This Universal Calabi–Yau algebra is a powerful tool for deciphering the Calabi–Yau genome in all dimensions.


Author(s):  
Axel Dahlberg ◽  
Stephanie Wehner

Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from another stabilizer (source) state by single-qubit Clifford operations (LC), single-qubit Pauli measurements (LPM) and classical communication (CC) between sites holding the individual qubits. What is more, we provide a recipe to obtain the sequence of LC+LPM+CC operations which prepare the desired target state from the source state, and show how these operations can be applied in parallel to reach the target state in constant time. Our algorithm has applications in quantum networks, quantum computing, and can also serve as a design tool—for example, to find transformations between quantum error correcting codes. We provide a software implementation of our algorithm that makes this tool easier to apply. A key insight leading to our algorithm is to show that the problem is equivalent to one in graph theory, which is to decide whether some graph G ′ is a vertex-minor of another graph G . The vertex-minor problem is, in general, -Complete, but can be solved efficiently on graphs which are not too complex. A measure of the complexity of a graph is the rank-width which equals the Schmidt-rank width of a subclass of stabilizer states called graph states, and thus intuitively is a measure of entanglement. Here, we show that the vertex-minor problem can be solved in time O (| G | 3 ), where | G | is the size of the graph G , whenever the rank-width of G and the size of G ′ are bounded. Our algorithm is based on techniques by Courcelle for solving fixed parameter tractable problems, where here the relevant fixed parameter is the rank width. The second half of this paper serves as an accessible but far from exhausting introduction to these concepts, that could be useful for many other problems in quantum information. This article is part of a discussion meeting issue ‘Foundations of quantum mechanics and their impact on contemporary society’.


1998 ◽  
Vol 238 (4-5) ◽  
pp. 213-218 ◽  
Author(s):  
Ranjan Kumar Ghosh ◽  
Sumathi Rao

Sign in / Sign up

Export Citation Format

Share Document