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

Quantum counting and writing: Exotic quantum statistics and the translation of quantum texts

Randall Espinoza

Published Jan 1, 2005• 0 citations
OpenAlex

Abstract

Quantum counting and writing: Exotic quantum statistics and the translation of quantum texts.

Related papers

Counting and Measuring — Quantum Statistics and Quantum Standards

WORLD SCIENTIFIC eBooks•Feb 1, 2012•0 citations

A quantum random access memory (QRAM) using a polynomial encoding of binary strings

Priyanka Mukhopadhyay

Quantum algorithms claim significant speedup over their classical counterparts for solving many problems. An important aspect of many of these algorithms is the existence of a quantum oracle, which needs to be implemented efficiently in order to realize the claimed advantages in practice. A quantum random access memory (QRAM) is a promising architecture for realizing these oracles. In this paper we develop a new design for QRAM and implement it with Clifford+T circuit. We focus on optimizing the T-count and T-depth since non-Clifford gates are the most expensive to implement fault-tolerantly in most error correction schemes. Integral to our design is a polynomial encoding of bit strings and so we refer to this design as [Formula: see text]. Compared to the previous state-of-the-art bucket brigade architecture for QRAM, we achieve an exponential improvement in T-depth, while reducing T-count and keeping the qubit-count same. Specifically, if N is the number of memory locations to be queried, then [Formula: see text] has T-depth [Formula: see text], T-count [Formula: see text] and uses O(N) logical qubits, while the bucket brigade circuit has T-depth [Formula: see text], T-count O(N) and uses O(N) qubits. Combining two [Formula: see text] we design a quantum look-up-table, [Formula: see text], that has T-depth [Formula: see text], T-count [Formula: see text] and qubit count [Formula: see text]. A quantum look-up table (qLUT) or quantum read-only memory (QROM) has restricted functionality than a QRAM. For example, it cannot write into a memory location and the circuit needs to be compiled each time the contents of the memory change. The previous state-of-the-art CSWAP architecture has T-depth [Formula: see text], T-count [Formula: see text] and qubit count [Formula: see text]. Thus we achieve a double exponential improvement in T-depth while keeping the T-count and qubit-count asymptotically same. Additionally, with our polynomial encoding of bit strings, we develop a method to optimize the Toffoli-count of circuits, specially those consisting of multi-controlled-NOT gates.

arXiv:2408.16794•Scientific Reports•Mar 31, 2025•13 citations

Counting and Measuring — Quantum Statistics and Quantum Standards

WORLD SCIENTIFIC eBooks•Jun 1, 2008•0 citations

Generalized interpolative quantum statistics

R. Ramanathan

A generalized interpolative quantum statistics is presented by conjecturing a certain reordering of phase space due to the presence of possible exotic objects other than bosons and fermions. Such an interpolation achieved through a Bose-counting strategy predicts the existence of an infinite quantum Boltzmann-Gibbs statistics akin to the one discovered by Greenberg recently.

Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields•Jun 15, 1992•18 citations

Mathematical and physical foundations of quantum statistics

Milan Vinduška

International Journal of Theoretical Physics•Aug 1, 1995•0 citations

Quantum criticality in many-body parafermion chains

Ville Lahtinen, Teresia Månsson, Eddy Ardonne

We construct local generalizations of 3-state Potts models with exotic critical points. We analytically show that these are described by non-diagonal modular invariant partition functions of products of Z_3 Z 3 parafermion or u(1)_6 u ( 1 ) 6 conformal field theories (CFTs). These correspond either to non-trivial permutation invariants or block diagonal invariants, that one can understand in terms of anyon condensation. In terms of lattice parafermion operators, the constructed models correspond to parafermion chains with many-body terms. Our construction is based on how the partition function of a CFT depends on symmetry sectors and boundary conditions. This enables to write the partition function corresponding to one modular invariant as a linear combination of another over different sectors and boundary conditions, which translates to a general recipe how to write down a microscopic model, tuned to criticality. We show that the scheme can also be extended to construct critical generalizations of k k -state clock type models.

arXiv:1709.04259•SciPost Physics Core•May 28, 2021•13 citations
Quantum algorithms claim significant speedup over their classical counterparts for solving many problems. An important aspect of many of these algorithms is the existence of a quantum oracle, which needs to be implemented efficiently in order to realize the claimed advantages in practice. A quantum random access memory (QRAM) is a promising architecture for realizing these oracles. In this paper we develop a new design for QRAM and implement it with Clifford+T circuit. We focus on optimizing the T-count and T-depth since non-Clifford gates are the most expensive to implement fault-tolerantly in most error correction schemes. Integral to our design is a polynomial encoding of bit strings and so we refer to this design as [Formula: see text]. Compared to the previous state-of-the-art bucket brigade architecture for QRAM, we achieve an exponential improvement in T-depth, while reducing T-count and keeping the qubit-count same. Specifically, if N is the number of memory locations to be queried, then [Formula: see text] has T-depth [Formula: see text], T-count [Formula: see text] and uses O(N) logical qubits, while the bucket brigade circuit has T-depth [Formula: see text], T-count O(N) and uses O(N) qubits. Combining two [Formula: see text] we design a quantum look-up-table, [Formula: see text], that has T-depth [Formula: see text], T-count [Formula: see text] and qubit count [Formula: see text]. A quantum look-up table (qLUT) or quantum read-only memory (QROM) has restricted functionality than a QRAM. For example, it cannot write into a memory location and the circuit needs to be compiled each time the contents of the memory change. The previous state-of-the-art CSWAP architecture has T-depth [Formula: see text], T-count [Formula: see text] and qubit count [Formula: see text]. Thus we achieve a double exponential improvement in T-depth while keeping the T-count and qubit-count asymptotically same. Additionally, with our polynomial encoding of bit strings, we develop a method to optimize the Toffoli-count of circuits, specially those consisting of multi-controlled-NOT gates.
We construct local generalizations of 3-state Potts models with exotic critical points. We analytically show that these are described by non-diagonal modular invariant partition functions of products of Z_3 Z 3 parafermion or u(1)_6 u ( 1 ) 6 conformal field theories (CFTs). These correspond either to non-trivial permutation invariants or block diagonal invariants, that one can understand in terms of anyon condensation. In terms of lattice parafermion operators, the constructed models correspond to parafermion chains with many-body terms. Our construction is based on how the partition function of a CFT depends on symmetry sectors and boundary conditions. This enables to write the partition function corresponding to one modular invariant as a linear combination of another over different sectors and boundary conditions, which translates to a general recipe how to write down a microscopic model, tuned to criticality. We show that the scheme can also be extended to construct critical generalizations of k k -state clock type models.