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

Wiley eBooks

Counting States and Counting Operations

A. Alan Middleton

Published May 11, 2004• 0 citations
Publisher
DOI
10.1002/3527603794.ch5

Related papers

Counting States

Lessons from nanoscience•Feb 1, 2023•0 citations

How to check the one-count operator experimentally

Alexandre V. Dodonov, Salomon Sylvain Mizrahi, V. V. Dodonov

We propose an experimental scheme to probe the form of one-count operation used in the theory of continuous photodetection in cavities. Two main steps are: 1) an absorption of a single photon by an atom passing through a high-Q cavity containing electromagnetic field in a thermal or coherent state, 2) a subsequent measurement of the photon statistics in the new field state arising after the photon absorption. Then comparing the probabilities of finding 0 and 1 photons in the initial and final states of the field, one can make conclusions on the form of the one-count operation. This method can be readily applied in the microwave cavity QED with present technology.

arXiv:quant-ph/0701162•Jan 22, 2007•0 citations

Either Aspect May Come First: The Sever's Two Counts Admit an Ordering, So Co-Birth Is Imposed, Never Forced

William Alexander Aldred

Target M6 of the books-science correlations record: determine in-frame whether the sever's two count formalizations force simultaneity of the pair's two aspects (extracts E4 and E13: the wave and the particle co-born, neither prior) or admit an ordering. Gates reproduce papers #207 and #581 (operator count classification) and paper #238 (states meeting both formalizations at once at odd k from 1 to 41; independence at 201 values each; the fair-sign transcription recomputed exactly, mean surplus 16.185 and P(11) = 0.0679). New work: the joint range of the two counts is 42,642 admissible pairs, of which the simultaneous diagonal pairs number 103. Both orderings are exhibited with explicit states: operator count settled at its declared 11 while the surplus takes values 1, 11, 41, 201, 401, and the reverse. The fair-sign transcription settles the operator count at 1 on every state while the surplus remains a distribution. Verdict: imposing both formalizations at once is an extra condition selecting the diagonal, never a consequence of the formalizations; co-birth survives only as a permitted imposed condition, and is killed as an in-frame necessity. Grade EXTENSION, argued with DERIVED-INDEPENDENT considered and declined. Quantum gravity NOT SOLVED; vacuum catastrophe NOT SOLVED.

•Nov 3, 2026•0 citations

Quanta: Counting States

Princeton University Press eBooks•Jun 16, 2020•0 citations

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding

Tongyang Li, Fengning Ou, Xinzhao Wang +3 more

Many quantum algorithms require coherent access to classical data, often modeled by quantum read-only memory (QROM). We initiate the study of the $\mathrm{T}$ count of sparse QROM, in which only $s$ of the $2^n$ addresses store nonzero data. We prove that the optimal $\mathrm{T}$ count is $Θ\left(n+\min\left\{s,\sqrt{s\left(m+\log(2^{n+1}/s)\right)}\right\}\right)$. Our upper bounds use a multilevel hashing scheme, while our lower bounds reduce sparse QROM to state preparation and use counting arguments for adaptive Clifford+$\mathrm{T}$ circuits. The lower bounds thus hold even when mid-circuit measurements and classically controlled operations are allowed. As applications, we obtain matching $\mathrm{T}$-count bounds $Θ\left(\min\left\{s,\sqrt{s\log(2^{n+1}/s)}\right\} +\sqrt{s\log(1/\varepsilon)}+\log(1/\varepsilon)\right)$ for $s$-sparse state preparation and $Θ\left(\sqrt{2^n s\left(n+\log(1/\varepsilon_{\rm BE})\right)} +\log(1/\varepsilon_{\rm BE})\right)$ for block encoding of $s$-sparse matrices, where $\varepsilon$ and $\varepsilon_{\rm BE}$ are the precision of state preparation and block encoding, respectively.

quant-pharXiv:2607.28260•Jul 31, 2026•7 citations

Quantum embedding of graphs for subgraph counting

Bibhas Adhikari

We develop a unified quantum framework for subgraph counting in graphs. We encode a graph on $N$ vertices into a quantum state on $2\lceil \log_2 N \rceil$ working qubits and $2$ ancilla qubits using its adjacency list, with worst-case gate complexity $O(N^2)$, which we refer to as the graph adjacency state. We design quantum measurement operators that capture the edge structure of a target subgraph, enabling estimation of its count via measurements on the $m$-fold tensor product of the adjacency state, where $m$ is the number of edges in the subgraph. We illustrate the framework for triangles, cycles, and cliques. This approach yields quantum logspace algorithms for motif counting, with no known classical counterpart.

quant-pharXiv:2604.18754•Apr 22, 2026•1 citation
We propose an experimental scheme to probe the form of one-count operation used in the theory of continuous photodetection in cavities. Two main steps are: 1) an absorption of a single photon by an atom passing through a high-Q cavity containing electromagnetic field in a thermal or coherent state, 2) a subsequent measurement of the photon statistics in the new field state arising after the photon absorption. Then comparing the probabilities of finding 0 and 1 photons in the initial and final states of the field, one can make conclusions on the form of the one-count operation. This method can be readily applied in the microwave cavity QED with present technology.
Target M6 of the books-science correlations record: determine in-frame whether the sever's two count formalizations force simultaneity of the pair's two aspects (extracts E4 and E13: the wave and the particle co-born, neither prior) or admit an ordering. Gates reproduce papers #207 and #581 (operator count classification) and paper #238 (states meeting both formalizations at once at odd k from 1 to 41; independence at 201 values each; the fair-sign transcription recomputed exactly, mean surplus 16.185 and P(11) = 0.0679). New work: the joint range of the two counts is 42,642 admissible pairs, of which the simultaneous diagonal pairs number 103. Both orderings are exhibited with explicit states: operator count settled at its declared 11 while the surplus takes values 1, 11, 41, 201, 401, and the reverse. The fair-sign transcription settles the operator count at 1 on every state while the surplus remains a distribution. Verdict: imposing both formalizations at once is an extra condition selecting the diagonal, never a consequence of the formalizations; co-birth survives only as a permitted imposed condition, and is killed as an in-frame necessity. Grade EXTENSION, argued with DERIVED-INDEPENDENT considered and declined. Quantum gravity NOT SOLVED; vacuum catastrophe NOT SOLVED.
Many quantum algorithms require coherent access to classical data, often modeled by quantum read-only memory (QROM). We initiate the study of the T\mathrm{T}T count of sparse QROM, in which only sss of the 2n2^n2n addresses store nonzero data. We prove that the optimal T\mathrm{T}T count is Θ(n+min⁡{s,s(m+log⁡(2n+1/s))})Θ\left(n+\min\left\{s,\sqrt{s\left(m+\log(2^{n+1}/s)\right)}\right\}\right)Θ(n+min{s,s(m+log(2n+1/s))​}). Our upper bounds use a multilevel hashing scheme, while our lower bounds reduce sparse QROM to state preparation and use counting arguments for adaptive Clifford+T\mathrm{T}T circuits. The lower bounds thus hold even when mid-circuit measurements and classically controlled operations are allowed. As applications, we obtain matching T\mathrm{T}T-count bounds Θ(min⁡{s,slog⁡(2n+1/s)}+slog⁡(1/ε)+log⁡(1/ε))Θ\left(\min\left\{s,\sqrt{s\log(2^{n+1}/s)}\right\} +\sqrt{s\log(1/\varepsilon)}+\log(1/\varepsilon)\right)Θ(min{s,slog(2n+1/s)​}+slog(1/ε)​+log(1/ε)) for sss-sparse state preparation and Θ(2ns(n+log⁡(1/εBE))+log⁡(1/εBE))Θ\left(\sqrt{2^n s\left(n+\log(1/\varepsilon_{\rm BE})\right)} +\log(1/\varepsilon_{\rm BE})\right)Θ(2ns(n+log(1/εBE​))​+log(1/εBE​)) for block encoding of sss-sparse matrices, where ε\varepsilonε and εBE\varepsilon_{\rm BE}εBE​ are the precision of state preparation and block encoding, respectively.
We develop a unified quantum framework for subgraph counting in graphs. We encode a graph on NNN vertices into a quantum state on 2⌈log⁡2N⌉2\lceil \log_2 N \rceil2⌈log2​N⌉ working qubits and 222 ancilla qubits using its adjacency list, with worst-case gate complexity O(N2)O(N^2)O(N2), which we refer to as the graph adjacency state. We design quantum measurement operators that capture the edge structure of a target subgraph, enabling estimation of its count via measurements on the mmm-fold tensor product of the adjacency state, where mmm is the number of edges in the subgraph. We illustrate the framework for triangles, cycles, and cliques. This approach yields quantum logspace algorithms for motif counting, with no known classical counterpart.