Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2203.11643 · Journal of High Energy Physics

Relation between spectra of Narain CFTs and properties of associated boolean functions

Yuma Furuta

Published Sep 19, 2022• 23 citations
arXivHTMLPDF

Abstract

Abstract Recently, the construction of Narain CFT from a certain class of quantum error correcting codes has been discovered. In particular, the spectral gap of Narain CFT corresponds to the binary distance of the code, not the genuine Hamming distance. In this paper, we show that the binary distance is identical to the so-called EPC distance of the boolean function uniquely associated with the quantum code. Therefore, seeking Narain CFT with large spectral gap can be addressed by getting a boolean function with high EPC distance. Furthermore, this problem can be undertaken by finding lower Peak-to-Average Power ratio (PAR) with respect to the binary truth table of the boolean function. Though this is neither sufficient nor necessary condition for high EPC distance, we construct some examples of relatively high EPC distances referring to the constructions for lower PAR. We also see that codes with high distance are related to induced graphs with low independence numbers.

DOI
10.1007/jhep09(2022)146

Related papers

Non-rational Narain CFTs from codes over F4

Anatoly Y. Dymarsky, Adar Sharon

Abstract We construct a map between a class of codes over F4 and a family of non-rational Narain CFTs. This construction is complementary to a recently introduced relation between quantum stabilizer codes and a class of rational Narain theories. From the modular bootstrap point of view we formulate a polynomial ansatz for the partition function which reduces modular invariance to a handful of algebraic easy-to-solve constraints. For certain small values of central charge our construction yields optimal theories, i.e. those with the largest value of the spectral gap.

arXiv:2107.02816•Journal of High Energy Physics•Nov 1, 2021•36 citations

On Self-Dual Quantum Codes, Graphs, and Boolean Functions

Lars Eirik Danielsen

A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes with high minimum distance can be described as nested regular graphs having minimum regular vertex degree and containing long cycles. Two graphs correspond to equivalent quantum codes if they are related by a sequence of local complementations. We use this operation to generate orbits of graphs, and thus classify all inequivalent self-dual additive codes over GF(4) of length up to 12, where previously only all codes of length up to 9 were known. We show that these codes can be interpreted as quadratic Boolean functions, and we define non-quadratic quantum codes, corresponding to Boolean functions of higher degree. We look at various cryptographic properties of Boolean functions, in particular the propagation criteria. The new aperiodic propagation criterion (APC) and the APC distance are then defined. We show that the distance of a zero-dimensional quantum code is equal to the APC distance of the corresponding Boolean function. Orbits of Boolean functions with respect to the {I,H,N}^n transform set are generated. We also study the peak-to-average power ratio with respect to the {I,H,N}^n transform set (PAR_IHN), and prove that PAR_IHN of a quadratic Boolean function is related to the size of the maximum independent set over the corresponding orbit of graphs. A construction technique for non-quadratic Boolean functions with low PAR_IHN is proposed. It is finally shown that both PAR_IHN and APC distance can be interpreted as partial entanglement measures.

arXiv:quant-ph/0503236•Mar 31, 2005•49 citations

Quantum stabilizer codes, lattices, and CFTs

Anatoly Y. Dymarsky, Alfred D. Shapere

Abstract There is a rich connection between classical error-correcting codes, Euclidean lattices, and chiral conformal field theories. Here we show that quantum error-correcting codes, those of the stabilizer type, are related to Lorentzian lattices and non-chiral CFTs. More specifically, real self-dual stabilizer codes can be associated with even self-dual Lorentzian lattices, and thus define Narain CFTs. We dub the resulting theories code CFTs and study their properties. T-duality transformations of a code CFT, at the level of the underlying code, reduce to code equivalences. By means of such equivalences, any stabilizer code can be reduced to a graph code. We can therefore represent code CFTs by graphs. We study code CFTs with small central charge c = n ≤ 12, and find many interesting examples. Among them is a non-chiral E8 theory, which is based on the root lattice of E8 understood as an even self-dual Lorentzian lattice. By analyzing all graphs with n ≤ 8 nodes we find many pairs and triples of physically distinct isospectral theories. We also construct numerous modular invariant functions satisfying all the basic properties expected of the CFT partition function, yet which are not partition functions of any known CFTs. We consider the ensemble average over all code theories, calculate the corresponding partition function, and discuss its possible holographic interpretation. The paper is written in a self-contained manner, and includes an extensive pedagogical introduction and many explicit examples.

arXiv:2009.01244•Journal of High Energy Physics•Mar 1, 2021•71 citations

On Connections Between Graphs, Codes, Quantum States, and Boolean Functions

Lars Eirik Danielsen

We study objects that can be represented as graphs, error-correcting codes, quantum states, or Boolean functions. It is known that self-dual additive codes, which can also be interpreted as quantum states, can be represented as graphs, and that two codes are equivalent when the corresponding graphs are equivalent with respect to local complementation (LC). We give classifications of such codes. Circulant graph codes are introduced, and it is shown that some of these codes have highly regular graph representations. We show that the orbit of a bipartite graph under edge local complementation (ELC) corresponds to the equivalence class of a binary linear code. We classify ELC orbits, give a new method for classifying binary linear codes, and show that the information sets and the minimum distance of a code can be derived from the corresponding ELC orbit. Self-dual additive codes over GF(4) can also be interpreted as quadratic Boolean functions. In this context we define PARIHN, peak-to-average power ratio with respect to the {I, H, N}n transform, and prove that PARIHN equals the size of the maximum independent set over the associated LC orbit of graphs. We define the aperiodic propagation criteria (APC) of a Boolean function, and show that it is related to the minimum distance of a self-dual additive code over GF(4), and to the degree of entanglement in the associated quantum state. We give a generalization to non-quadratic Boolean functions, and relate APC to known cryptographic criteria. Interlace polynomials encode many properties of the LC and ELC orbits of a graph. We enumerate interlace polynomials and circle graphs, show that there exist non-unimodal interlace polynomials, and relate properties of interlace polynomials to properties of codes and quantum states. We define self-dual bent functions, and provide constructions and classifications.

•May 28, 2008•3 citations

Narain CFTs from qudit stabilizer codes

Kohki Kawabata, Tatsuma Nishioka, Takuya Okuda

We construct a discrete subset of Narain CFTs from quantum stabilizer codes with qudit (including qubit) systems whose dimension is a prime number. Our construction exploits three important relations. The first relation is between qudit stabilizer codes and classical codes. The second is between classical codes and Lorentzian lattices. The third is between Lorentzian lattices and Narain CFTs. In particular, we study qudit Calderbank-Shor-Steane (CSS) codes as a special class of qudit stabilizer codes and the ensembles of the Narain code CFTs constructed from CSS codes. We obtain exact results for the averaged partition functions over the ensembles and discuss their implications for holographic duality.

arXiv:2212.07089•SciPost Physics Core•Apr 26, 2023•27 citations

Narain CFTs from nonbinary stabilizer codes

Y. F. Alam, Kohki Kawabata, Tatsuma Nishioka +2 more

Abstract We generalize the construction of Narain conformal field theories (CFTs) from qudit stabilizer codes to the construction from quantum stabilizer codes over the finite field of prime power order ( $$ {\mathbbm{F}}_{p^m} $$ F p m with p prime and m ≥ 1) or over the ring ℤk with k > 1. Our construction results in rational CFTs, which cover a larger set of points in the moduli space of Narain CFTs than the previous one. We also propose a correspondence between a quantum stabilizer code with non-zero logical qubits and a finite set of Narain CFTs. We illustrate the correspondence with well-known stabilizer codes.

arXiv:2307.10581•Journal of High Energy Physics•Dec 19, 2023•25 citations
Abstract Recently, the construction of Narain CFT from a certain class of quantum error correcting codes has been discovered. In particular, the spectral gap of Narain CFT corresponds to the binary distance of the code, not the genuine Hamming distance. In this paper, we show that the binary distance is identical to the so-called EPC distance of the boolean function uniquely associated with the quantum code. Therefore, seeking Narain CFT with large spectral gap can be addressed by getting a boolean function with high EPC distance. Furthermore, this problem can be undertaken by finding lower Peak-to-Average Power ratio (PAR) with respect to the binary truth table of the boolean function. Though this is neither sufficient nor necessary condition for high EPC distance, we construct some examples of relatively high EPC distances referring to the constructions for lower PAR. We also see that codes with high distance are related to induced graphs with low independence numbers.
Abstract We construct a map between a class of codes over F4 and a family of non-rational Narain CFTs. This construction is complementary to a recently introduced relation between quantum stabilizer codes and a class of rational Narain theories. From the modular bootstrap point of view we formulate a polynomial ansatz for the partition function which reduces modular invariance to a handful of algebraic easy-to-solve constraints. For certain small values of central charge our construction yields optimal theories, i.e. those with the largest value of the spectral gap.
A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes with high minimum distance can be described as nested regular graphs having minimum regular vertex degree and containing long cycles. Two graphs correspond to equivalent quantum codes if they are related by a sequence of local complementations. We use this operation to generate orbits of graphs, and thus classify all inequivalent self-dual additive codes over GF(4) of length up to 12, where previously only all codes of length up to 9 were known. We show that these codes can be interpreted as quadratic Boolean functions, and we define non-quadratic quantum codes, corresponding to Boolean functions of higher degree. We look at various cryptographic properties of Boolean functions, in particular the propagation criteria. The new aperiodic propagation criterion (APC) and the APC distance are then defined. We show that the distance of a zero-dimensional quantum code is equal to the APC distance of the corresponding Boolean function. Orbits of Boolean functions with respect to the {I,H,N}^n transform set are generated. We also study the peak-to-average power ratio with respect to the {I,H,N}^n transform set (PAR_IHN), and prove that PAR_IHN of a quadratic Boolean function is related to the size of the maximum independent set over the corresponding orbit of graphs. A construction technique for non-quadratic Boolean functions with low PAR_IHN is proposed. It is finally shown that both PAR_IHN and APC distance can be interpreted as partial entanglement measures.
Abstract There is a rich connection between classical error-correcting codes, Euclidean lattices, and chiral conformal field theories. Here we show that quantum error-correcting codes, those of the stabilizer type, are related to Lorentzian lattices and non-chiral CFTs. More specifically, real self-dual stabilizer codes can be associated with even self-dual Lorentzian lattices, and thus define Narain CFTs. We dub the resulting theories code CFTs and study their properties. T-duality transformations of a code CFT, at the level of the underlying code, reduce to code equivalences. By means of such equivalences, any stabilizer code can be reduced to a graph code. We can therefore represent code CFTs by graphs. We study code CFTs with small central charge c = n ≤ 12, and find many interesting examples. Among them is a non-chiral E8 theory, which is based on the root lattice of E8 understood as an even self-dual Lorentzian lattice. By analyzing all graphs with n ≤ 8 nodes we find many pairs and triples of physically distinct isospectral theories. We also construct numerous modular invariant functions satisfying all the basic properties expected of the CFT partition function, yet which are not partition functions of any known CFTs. We consider the ensemble average over all code theories, calculate the corresponding partition function, and discuss its possible holographic interpretation. The paper is written in a self-contained manner, and includes an extensive pedagogical introduction and many explicit examples.
We study objects that can be represented as graphs, error-correcting codes, quantum states, or Boolean functions. It is known that self-dual additive codes, which can also be interpreted as quantum states, can be represented as graphs, and that two codes are equivalent when the corresponding graphs are equivalent with respect to local complementation (LC). We give classifications of such codes. Circulant graph codes are introduced, and it is shown that some of these codes have highly regular graph representations. We show that the orbit of a bipartite graph under edge local complementation (ELC) corresponds to the equivalence class of a binary linear code. We classify ELC orbits, give a new method for classifying binary linear codes, and show that the information sets and the minimum distance of a code can be derived from the corresponding ELC orbit. Self-dual additive codes over GF(4) can also be interpreted as quadratic Boolean functions. In this context we define PARIHN, peak-to-average power ratio with respect to the {I, H, N}n transform, and prove that PARIHN equals the size of the maximum independent set over the associated LC orbit of graphs. We define the aperiodic propagation criteria (APC) of a Boolean function, and show that it is related to the minimum distance of a self-dual additive code over GF(4), and to the degree of entanglement in the associated quantum state. We give a generalization to non-quadratic Boolean functions, and relate APC to known cryptographic criteria. Interlace polynomials encode many properties of the LC and ELC orbits of a graph. We enumerate interlace polynomials and circle graphs, show that there exist non-unimodal interlace polynomials, and relate properties of interlace polynomials to properties of codes and quantum states. We define self-dual bent functions, and provide constructions and classifications.
We construct a discrete subset of Narain CFTs from quantum stabilizer codes with qudit (including qubit) systems whose dimension is a prime number. Our construction exploits three important relations. The first relation is between qudit stabilizer codes and classical codes. The second is between classical codes and Lorentzian lattices. The third is between Lorentzian lattices and Narain CFTs. In particular, we study qudit Calderbank-Shor-Steane (CSS) codes as a special class of qudit stabilizer codes and the ensembles of the Narain code CFTs constructed from CSS codes. We obtain exact results for the averaged partition functions over the ensembles and discuss their implications for holographic duality.
Abstract We generalize the construction of Narain conformal field theories (CFTs) from qudit stabilizer codes to the construction from quantum stabilizer codes over the finite field of prime power order ( $$ {\mathbbm{F}}_{p^m} $$ F p m with p prime and m ≥ 1) or over the ring ℤk with k > 1. Our construction results in rational CFTs, which cover a larger set of points in the moduli space of Narain CFTs than the previous one. We also propose a correspondence between a quantum stabilizer code with non-zero logical qubits and a finite set of Narain CFTs. We illustrate the correspondence with well-known stabilizer codes.