betaFeedback

WorksComputer Science

Reproducible quantum clustering for single-cell transcriptome atlases

Abstract

Current single-cell clustering pipelines discard most genes and can yield inconsistent clusters across random seeds. We introduce KQE-2, a training-free hybrid quantum-classical framework for reproducible whole-transcriptome clustering. KQE-2 maps cells into entanglement-free quantum states, enabling exact feature evaluation on classical hardware and direct checks on a quantum processor. Theoretically, we prove that removing entanglement is necessary and sufficient to bound single-qubit feature variance locally. Practically, while retraining scVI shifted 14% of cells and altered rare-type markers and drug targets, KQE-2 delivered identical biology across runs. On standard highly variable genes, the quantum encoding alone raised accuracy on a developing cortex from 0.61 to 0.79. KQE-2 scales to 11.4 million nuclei on one server, outperforming the compared methods on eight of ten complete atlases (and within the best method's run-to-run range on two), and leads on six even under standard downstream clustering.

Single-cell atlases now span millions of cells, and clustering is the foundation for reading them.[1, 2, 3] Every downstream discovery, from cell types and marker genes to pathways and drug targets, is read from these clusters. Yet standard workflows discard most of the transcriptome upfront: scanpy and Seurat retain about 2,000 highly variable genes (HVGs), compress them by principal component analysis (PCA) and partition a nearest-neighbor graph.[4, 5] Deep generative (scVI) and foundation (scGPT) models embed restricted gene sets after GPU training,[6, 7] while dedicated clustering algorithms have been applied to only tens of thousands of cells.[8, 9, 10, 11]

What atlases need from clustering. Reference atlases demand more than a high summary score against an annotation. Standard metrics such as adjusted mutual information (AMI)[12] are dominated by abundant types: a method can score well while swallowing a rare type into a neighbor, erasing that population and its markers. Worse, partitions that shift with the training seed alter the resulting markers, pathways and drug targets, making the biology irreproducible across laboratories. Extended Data Table 1 defines nine requirements for trustworthy atlas clustering; KQE-2 meets all nine.

The problem. Can we cluster a million-cell atlas across its whole transcriptome, every measured gene, so that the same data always yield the same clusters and biology? Two obstacles stand in the way. First, HVG selection removes most genes upfront. Favoring variance across abundant populations, it systematically discards markers of rare types ( < 1% of cells).[13, 14, 15] Yet modern atlases hold 15 to 251 times more cells than genes, a regime in which the full transcriptome can be reliably estimated;[16] discarding genes discards biology. Second, learned embeddings can drift across runs: stochastic gradient descent reaches different local optima across seeds, scGPT samples 1,200 genes per cell at inference, and GPU floating-point accumulation is non-deterministic. Graph workflows are deterministic under a fixed seed, but can fracture abundant, homogeneous types along technical axes.[17]

Our idea. We encode the whole transcriptome into entanglement-free quantum states. Quantum feature maps embed data in exponentially large Hilbert spaces,[18, 19, 20, 21] but entangling gates make exact evaluation #P-hard (intractable in general)[22, 23] and leave hardware estimates vulnerable to shot noise and drift.[24, 25] Without entanglement, every quantum feature reduces to an exact closed form: bit-for-bit identical on every run, computable for millions of cells on one GPU and checkable on a quantum processor. Requiring no training, this encoding draws its resolving power from the whole transcriptome and bounded quantum-state geometry.

What is new. Existing quantum kernel methods rely on sampled, entangled maps,[20] and prior quantum single-cell tools clustered around 1,000 cells;[26, 27] classical HVG-free methods binarize detection or fit sparse Bayesian models.[28, 29] KQE-2 (kernel quantum encoding) evaluates every state exactly, retains the whole transcriptome and, to our knowledge, is the first quantum framework to cluster complete, multi-million-cell atlases reproducibly.

KQE-2 meets all nine requirements, ordered by importance:

  1. Bit-for-bit reproducible biology. KQE-2 returns identical clusters, markers, pathways and drug targets on every rerun, and gave identical clusters across servers for all 611,034 nuclei of a cerebellum atlas; retraining scVI with a new seed moved 14% of cells.

  1. Rare types and subtypes in imbalanced atlases. KQE-2 recovers rare populations more accurately than scanpy, Seurat, scVI and scGPT (stratified Wilcoxon test, P≤0.043P \le0.043; P≤2.1×10−8P \le2.1 \times10^{-8} against the first three) and isolates the notochord, Purkinje cells and endocardium in an 11.4-million-nucleus embryo atlas (F1 of 0.85 to 0.90).

  1. Full-scale coverage with leading accuracy. KQE-2 scales to human, mouse and zebrafish atlases of up to 11.4 million nuclei, the only method to partition the largest, leading on eight of ten complete atlases and within the best method’s run-to-run range on two.

  1. Whole-transcriptome resolution. KQE-2 retains every gene (switching to 5,000 HVGs, by a label-free rule based on data entropy and the requested number of clusters, on only three of ten atlases) and rescues types whose markers HVG selection strips, raising the share of lens fiber cells in their primary cluster from 0.40 to 1.00.

  1. Zero training. KQE-2 requires neither stochastic gradient descent nor a pretraining corpus.

  1. Theoretical guarantees. We prove that removing entanglement is necessary and sufficient to keep single-qubit feature variance local against data and hardware noise. When two randomized decompositions yielded different scores, the encoding preserved the clusters (ARI of 0.90 and 0.99, versus 0.43 and 0.81).

  1. Exact, auditable quantum-state geometry. Theorem 4 certifies exact nearest quantum states for 888,263 nuclei in 100 s. KQE-2 clusters on this certified graph, which also gave the first exact quantum-state map of a complete 11.4-million-nucleus atlas.

  1. Quantum hardware check. On an IBM quantum processor, measured features across 380 cells matched exact values with a correlation of 0.978.

  1. Deterministic donor correction. Quantum alignment removes donor batch effects without random seeds, raising AMI on a 79-donor heart atlas from 0.92 to 0.96 (versus 0.81 for Harmony).

Together, these results establish that an exact, entanglement-free quantum representation can cluster complete single-cell atlases of over ten million nuclei with leading accuracy on most complete atlases and bit-for-bit reproducibility.

Results

KQE-2 maps every cell to an exact quantum state

KQE-2 turns the whole transcriptome of each cell into an exact quantum state in four deterministic steps (Figure 1). First, the log-transformed counts of the whole transcriptome are weighted by inverse document frequency (IDF), which raises the weight of genes detected in few cells, the signature of a marker. Second, a deterministic singular value decomposition (SVD), started from a fixed vector, gives 132 directions with no random step. A null model that permutes each gene across cells separates the signal directions from noise. Their data entropy, the Shannon entropy of their normalized singular values,[30] measures how many independent expression programs they hold. Rounded up, it is five to seven across the atlases, and KQE-2 uses six qubits per block (Figure 2c–Figure 2e). Third, each of the 132 scores, scaled to unit variance (whitened), rotates its own qubit in three layers that each load the score again (re-uploading layers), with no entangling gate. Each cell then has 726 quantum features: the Bloch vector of each qubit, made of the three expectations that fully describe its state, and the pairwise correlations within each block. Fourth, the cells are clustered on the graph of their quantum states by quantum precision shrinkage clustering (Q-PSC; Methods). Each cell is joined to its 15 nearest quantum states, found exactly and certified by Theorem 4, with edges weighted by the state fidelity. The Leiden algorithm first divides this graph into round⁡(1.5k)\operatorname{round}(1.5k) clusters, and the two clusters with the largest summed fidelity relative to their size are merged repeatedly until kk remain, the number of annotated types.

Figure 1. KQE-2 turns the whole transcriptome of each cell into an exact quantum state and clusters complete atlases. a, The pipeline. Counts of all genes are weighted by inverse document frequency (IDF). A deterministic singular value decomposition (SVD) with no random seed gives 132 directions; a gene-permutation null separates signal from noise and sets the number of qubits, and the scores are scaled to unit variance (whitened). Each score rotates its own qubit through three layers of RYR_Y and RZR_Z rotations with no entangling gate, so each cell becomes a product of exact single-qubit states and the fidelity of two cells is a product over qubits. Quantum precision single-qubit clustering (Q-PC) then clusters such states, weights the edges by fidelity, to yield an atlas about 1.5k clusters with Leiden and merges them to the kk annotated types. b, Siletti non-neuronal brain atlas. Left, Bloch vectors of three qubits: no single qubit separates the types. Middle, SR-tSNE2 map of the quantum features of up to 3,000 nuclei per type (13 types; AMI 0.96, Table 1): the 132 qubits together separate them. Right, exact fidelity between each nucleus and its 15 nearest states, weights them by fidelity, with the edges by fidelity, of the same or different types. c, All 11,441,407 nuclei of the complete mouse embryo atlas, mapped from their certified 15-nearest-state graph and colored by eight lineages merged from the author annotations. d, On the same map, the notochord, Purkinje cells, endocardium, amacrine cells and amnion epithelium form rare separate states. e, The 12 datasets of study, up to 11.4 million cells; the 2.86-million-nucleus mouse embryo subset and the complete atlas are plotted separately. f, AMI on the ten complete atlases (Table 1): KQE-2 is the most accurate on eight and within the run-to-run range of the best method on the other two; dash, not run or not applicable.

Figure 2. Each cell type has its own quantum barcode. a, Quantum barcodes of the nine cell types of the cardiomyopathy heart atlas: for each type, the 40 of the 726 exact quantum features that mark it most, signed so that the type mean is positive (rows, cells; columns, features). b, SR-t-SNE2 map of the quantum features of 60,689 heart cells, in which the nine types separate. c, The 132 whitened scores of a cell fill 22 blocks of six qubits. Each score rotates its own qubit by RY(2−(t−1)sx)R_Y\left(2^{-(t-1)}sx\right) and RZ(sx)R_Z(sx), t=1,2,3t = 1, 2, 3, s=0.19s = 0.19, with no entangling gate, giving 726 exact features per cell. d, The Bloch vector of one qubit traces a bounded path as its score grows, columns, features. e, The data are binned into six qubits per block at the median (Theorem 1). f, Quantum alignment removes donor offsets as donor-specific rotations, with no random number.

A gene-set rule, also based on data entropy, decides the input before any clustering; it uses the requested number of clusters kk and no label. KQE-2 keeps the whole transcriptome unless the atlas holds many more expression programs than requested clusters, in which case it uses 5,000 HVGs (Methods). A large excess means that most of the additional programs describe variation within the requested types, as in the developing cortex, annotated with five to eight broad classes; there, 5,000 HVGs focus the states on the differences between types. Labels are never used to build the graph; they set only the number of clusters kk and score the result.

Four guarantees. Four theorems (Methods) set the number of qubits per block (Theorem 1), bound the variance of each feature independently of the number of qubits (Theorem 2), show that removing entanglement is necessary and sufficient for this bound on single-qubit features (Theorem 3) and bound feature distances by state distances (Theorem 4).

The quantum encoding resolves cell types that the whitened scores merge

Gain on the standard input. The quantum encoding raises accuracy even when nothing else in a standard pipeline changes. With the 2,000 HVGs and principal components of scanpy held fixed, adding the encoding raised the AMI with the annotated types from 0.605 to 0.788 on the complete developing human cortex. On the brain atlas of the Rush Alzheimer’s Disease Center (RADC), it raised the AMI from 0.887 to 0.931.

Gain on the scores of KQE-2. The gain is larger on the 132 whitened scores of KQE-2 (Extended Data Table 2). On the 146,598-cell subsample of the developing cortex (five types), clustering these scores directly puts 92% of the cells in one cluster (AMI 0.18 to 0.20). Encoding the same scores resolves all five types (AMI 0.766 over three Leiden seeds). It also raises the F1 of oligodendrocyte precursor cells (OPCs) from 0.45 under scanpy to 0.96. (F1, the harmonic mean of precision and recall in the cluster holding most of a type’s cells) On the Siletti non-neuronal brain atlas, the encoding gives the OPCs their own cluster (AMI 0.935, against 0.815 for the whitened scores).

Gain on a complete atlas. The gain holds on complete atlases. On the complete developing cortex (693,544 nuclei, eight clusters, 5,000 HVGs by the rule), Leiden at kk on the 15-nearest-neighbor graph of the whitened scores gave an AMI of 0.580, and the same graph built on the quantum features of the same scores gave 0.731.

The gain is specific to the quantum encoding. None of the five families of classical feature maps tested on the same 132 scores reached the accuracy of the encoding. The gap was widest on the developing cortex, where one type holds 78% of the cells. There, random Fourier features, trigonometric, quadratic, tanh and clipping maps gave 0.03 to 0.53, against 0.766 for the encoding (Extended Data Figure 1; class imbalance, Supplementary Note 1).

Clusters form in exact quantum-state space

The encoding turns the Leiden graph into a graph of quantum states. Without entanglement, the exact fidelity of two cells, the squared overlap of their states, is a product over qubits and costs linear time (Theorem 4). The same theorem bounds the feature distance above and below by the state distance, and Supplementary Note 2 works an example. Across 80,000 pairs of 20,000 Siletti cells, every pair satisfied the lower bound, and the feature distance and the exact state distance had a Spearman correlation of 0.9998. On the human heart atlas, each of the nine types has its own barcode across the 726 quantum features (Figure 2a,Figure 2b).

A complete atlas in quantum-state space. The same geometry holds for every nucleus of a complete atlas (Figure 1b–Figure 1d; Supplementary Fig. 2). For each of the 888,263 nuclei of the Siletti atlas, we found its 15 nearest neighbors under the exact state distance −log⁡F-\log F over 132 qubits. With candidates taken by feature distance, for 888,146 nuclei (99.99%) the lower bound of Theorem 4 proves that no other nucleus can be closer; the remaining 117 nuclei were searched exhaustively, and the whole search took 100 s on one GPU (Methods). On average, 99.90% of the 15 nearest states of a nucleus lie in its own KQE-2 cluster (Table 1). Nearest states have a median fidelity of 0.12, against 0.00053 for random nuclei of different clusters. This certified graph is the graph that Q-PSC clusters, so each KQE-2 cluster is a region of nearby quantum states. To our knowledge, this is the first map of a complete single-cell atlas in exact quantum-state space. The same search covered all 11,441,407 nuclei of the complete mouse embryo atlas in 3.1 h on one GPU, with 104 nuclei searched exhaustively. There, 93% of the 15 nearest quantum states of a nucleus are its annotated type, and the notochord, Purkinje cells, endocardium, amacrine cells and amnion epithelium form islands of their own, with 83% to 94% of their nearest states in the same type (Figure 1c,Figure 1d; Supplementary Fig. 2e,f).

KQE-2 leads on eight of ten complete atlases

Benchmark. KQE-2 reached the highest accuracy on most complete atlases. We compared KQE-2 with scanpy,[4] Seurat,[5] scVI[6] and the foundation model scGPT[7] on ten complete atlases of 611,034 to 2,860,465 cells.[2, 31, 32, 33, 34, 35] Every other method used the same graph construction and Leiden protocol, and KQE-2 is reported both with this protocol and in its full configuration with Q-PSC (Table 1). KQE-2 was the most accurate method on eight atlases and within the range of the best method’s runs on the other two. With exactly the downstream protocol of the other methods, Leiden at kk on the feature graph, KQE-2 was the most accurate on six atlases and within 0.004 of the best method on three more (Table 1, column KQE-2), so the gain does not depend on the final clustering step. Its margin over the best other method ranged from 0.032 on the mouse cerebellum to 0.169 on the developing cortex. KQE-2 was also more accurate on the three atlases that scGPT may have seen in pretraining (Supplementary Note 3).

Atlases run after the gene-set rule was fixed. Three atlases were run after the gene-set rule had been fixed: its threshold, and for each atlas the value of Δ\Delta and the chosen gene set, were recorded with a time stamp before the first run (Methods). On 2,860,465 nuclei of the mouse embryo from gastrulation to birth,[36] KQE-2 was the only method that partitioned the cells into the 134 annotated types, and it reached 0.761, against 0.717 for scVI and 0.703 for scanpy. On the mouse cerebellum (611,034 nuclei, 78% granule cells),[37] KQE-2 reached 0.977, against 0.945 for scanpy. On the third, the mouse cortex,[38] KQE-2 was within the range of the best method’s seeds or runs, as it was on the RADC

atlas.

Contribution of Q-PSC. Both steps of Q-PSC add accuracy. The quantum-state graph alone raised Leiden at kk above the feature graph on the Siletti atlas (0.925 to 0.956), the mouse cerebellum (0.918 to 0.977) and the optic nerve (0.786 to 0.806). Merging then raised the AMI on six of the seven whole-transcriptome atlases, most on the fetal atlas (0.743 to 0.821) and the mouse embryo (0.722 to 0.761), and kept it on the mouse cerebellum (0.977). Merging joins the pieces of an abundant type, while rare types whose states are distinct keep their own clusters. On the three atlases for which the gene-set rule selects 5,000 HVGs, KQE-2 applies Leiden at kk directly (Supplementary Table 10). The merging step, adapted to the graphs of the other methods, is analysed in Supplementary Note 12. The accuracy of KQE-2 therefore comes from the quantum framework as a whole: the whole-transcriptome input, the exact quantum-state geometry and the merge, every step deterministic.

AtlasKQE-2KQE-2 + Q-PSC (seeds 0, 1, 2)
Developing cortex0.7300.742, 0.698, 0.716
RADC brain0.9460.800, 0.802, 0.805
Mouse cortex0.8440.773, 0.775, 0.765

Supplementary Table 10. Supplementary Table 10 | Q-PSC on the three, 5,000-HVG atlases of Table 1. AMI at the annotated kk for Leiden seeds 0, 1 and 2, on the same scores as the KQE-2 column of Table 1. KQE-2, Leiden at kk on the 15-nearest-neighbor graph of the quantum features (the configuration of Table 1 for these atlases); KQE-2 + Q-PSC, as on the whole-transcriptome atlases.

Statistical significance across atlases and rare types. Two paired tests show that the gains are systematic (Extended Data Supplementary Table 3). Across the ten atlases, KQE-2 exceeded the best other method by 0.050 AMI on average (median 0.042; bootstrap 95% confidence interval 0.025 to 0.082; one-sided Wilcoxon signed-rank test, P=0.0049P = 0.0049). It also exceeded each method separately (P=0.0020P = 0.0020 to 0.031). On rare types, the F1 of KQE-2 was higher than that of scanpy, Seurat, scVI and scGPT (332, 183, 480 and 260 rare types; mean gain 0.127, 0.110, 0.054 and 0.039; Wilcoxon signed-rank test stratified by atlas, P=1.1×10−26P = 1.1 \times10^{-26}, 1.1×10−141.1 \times10^{-14}, 2.1×10−82.1 \times10^{-8} and 0.043) (Extended Data Supplementary Table 3). On all seven whole-transcriptome atlases, Leiden at kk on the quantum-state graph, before merging, already exceeded every other method.

Annotated typecellspuritystabilityauthor subcluster (Jaccard); matched namemarkersconsistent with
GABAergic neuron6311.000.98Inhibitory neurons-1 (0.94)EBF1EBF1 86/12%, RARBRARB 76/12%, FOXP1FOXP1 83/27%, PDE10APDE10A 77/25%striatal projection neurons
GABAergic neuron5290.990.96Inhibitory neurons-19 (0.82)OPRM1OPRM1 75/5%, FIGNFIGN 88/11%, KCNMB2KCNMB2 98/20%striosomal projection neurons
GABAergic neuron12,5021.000.97Inhibitory neurons-7 (0.83); Lhx6 highNPH1NPH1 81/14%, SOX6SOX6 60/9%, ERBB4ERBB4 96/43%MGE-derived interneurons
GABAergic neuron8,9890.980.78Inhibitory neurons-3 (0.79)PDZRN3PDZRN3 80/10%, DLX6−AS1DLX6-AS1 75/16%, ADARB2ADARB2 70/22%CGE-derived interneurons
GABAergic neuron5,4141.000.94Inhibitory neurons-9 (0.92)OTX2−AS1OTX2-AS1 97/2%, CHRM2CHRM2 72/11%, ZFPM2ZFPM2 64/15%OTX2-positive GABAergic neurons
cardiac muscle cell14,1471.000.84Cardiomyocytes-2 (0.64); left ventricleMYL2MYL2 68/8%, MYH7MYH7 80/23%, MYL3MYL3 70/16%ventricular cardiomyocytes
oligodendrocyte7,4290.990.89several (0.24); OPCPDGFRAPDGFRA 70/6%, PCDH15PCDH15 92/39%oligodendrocyte precursor cells

Supplementary Table 3. Stable KQE-2 clusters of the fetal atlas within annotated types. Percentages, share of expressing cells in the cluster and in the other cells of the same annotated type. Stability, largest Jaccard index with a cluster of the Leiden-at-kk partition. Author subcluster, the numbered author subcluster that holds most of the cells, with its Jaccard index; matched name, the authors’ matched mouse cell type, given when it names the cluster.

Why KQE-2 leads. KQE-2 keeps abundant types whole while it separates OPCs (Figure 3). On the complete Siletti atlas, scanpy, Seurat and scGPT divide the mature oligodendrocytes, 55% of the cells, into two or three clusters. KQE-2 keeps 99.6% of them in one cluster and gives the OPCs their own. When clusters are paired one to one with annotated types, KQE-2 misassigns 3.5% of 150,000 Siletti nuclei and 9.0% of 146,598 developing cortex cells; the other methods misassign 21.5% to 32.2% and 27.5% to 32.4% (Figure 3). The split of the other methods follows technical quality: in scanpy, the second oligodendrocyte cluster has 7.6 times the mitochondrial read fraction of the largest one (Extended Data Figure 2). Every KQE-2 cluster carries the canonical markers of its type (Extended Data Figure 3). An ablation shows that whitening and the encoding together prevent the split (Extended Data Supplementary Table 4; Supplementary Note 4).

Figure 3. KQE-2 keeps abundant types whole and misassigns the fewest cells. Five embeddings of the same cells, each clustered by Leiden at the annotated kk (seed 0) and drawn as an SR-tSNE map (Methods). a, Siletti non-neuronal brain atlas: 150,000 nuclei, 13 types. b, Developing cortex: 146,598 cells, five types. Top rows, cells colored by annotated type; titles give the AMI on these cells (Table 1 reports the complete atlases). Bottom rows, misassigned cells in red: cells outside the cluster paired with their own type when the clusters and types are paired one to one (Hungarian algorithm). KQE-2 misassigns 3.5% and 9.0% of the cells; scanpy, Seurat, scVI and scGPT misassign 21.5% to 32.4%.

Extended Data Figure 2. The oligodendrocyte clusters of other methods follow technical quality. Siletti non-neuronal brain atlas, the 150,000 cells of Figure 3a with the complete-atlas partitions; for each method, the clusters that hold at least 5% of the annotated oligodendrocytes. a, Number of oligodendrocytes in each cluster: KQE-2 keeps 99.6% of them in one cluster, and scVI keeps them whole in this run, whereas scanpy, Seurat and scGPT split them. b, Median percentage of counts from the 37 mitochondrial genes: the second scanpy cluster has 7.6 times the mitochondrial fraction of the largest one, and the clusters of Seurat and scGPT differ 3.1- and 4.4-fold. c, Median counts per cell, which differ 1.5- and 2.5-fold between the clusters of Seurat and of scGPT. Dot size is proportional to the number of cells in the cluster.

Extended Data Figure 3. Every KQE-2 cluster carries the canonical markers of its type. Dot plots of the KQE-2 clusters with at least 0.5% of the cells, on the cells of Figure 3; rows, majority annotated type and cell count; dot size, fraction of expressing cells; color, scaled mean expression. a, Siletti non-neuronal brain atlas, complete-atlas KQE-2 partition (Q-PSC), 10 clusters: OPCs express PDGFRAPDGFRA, CSPG4CSPG4 and OLIG2OLIG2, microglia P2RY12P2RY12, CX3CR1CX3CR1 and CSF1RCSF1R, and oligodendrocytes MBPMBP, PLP1PLP1 and MOBPMOBP. b, developing cortex, 5 clusters.

KQE-2 clustercellsscanpySeuratscVI
striatal projection neurons12,6310.470.550.48
striosomal neurons (OPRM1)5290.020.030.02
MGE-derived interneurons12,5020.740.840.50
CGE-derived interneurons8,9890.580.640.38
OTX2-positive GABAergic neurons5,4140.640.850.82
ventricular cardiomyocytes14,1470.840.840.84
OPCs7,4290.830.880.84

Supplementary Table 4. Largest Jaccard index of each KQE-2 subtype cluster with a cluster of the other methods (fetal atlas). Leiden at kk, seed 0.

Scale without training. On one GPU, it embedded all 1,120,336 zebrafish cells on all 32,031 genes in 973 s with a peak memory of 13.2 GB. Four dedicated clustering methods did not complete 146,598 cells within 3 h and 150 GB (Extended Data Tables 1 and Supplementary Table 5; Supplementary Table 12; Supplementary Note 10). The largest run used the complete mouse embryo atlas,36{}^{36} 11,441,407 nuclei of 134 types and four times the subset of Table 1; its gene-set rule was recorded before the run. On one server (40 CPU cores, 502 GB of memory, one NVIDIA RTX 6000 Ada GPU), the deterministic decomposition of the whole transcriptome took 11.9 h and was bit-for-bit identical on rerun, the certified nearest-state graph took 3.1 h on one GPU, and Q-PSC took 100 min. KQE-2 partitioned the nuclei into the 134 annotated types with an AMI of 0.755, close to its accuracy

Annotated typenucleistabilitymarkersconsistent with
cerebral cortex GABAergic interneuron100,2220.95Ebf1Ebf1 76/11%, RarbRarb 66/9%, Foxp2Foxp2 80/29%striatal projection neurons
cerebral cortex GABAergic interneuron48,0460.94Drd2Drd2 49/2%, Adora2aAdora2a 14/0%, PenkPenk 9/1%indirect-pathway striatal projection neurons
cerebral cortex GABAergic interneuron117,3080.93Nxph1Nxph1 93/19%, Adarb2Adarb2 55/6%, MafMaf 50/4%, SstSst 12/1%MGE-derived interneurons
cerebral cortex GABAergic interneuron31,1980.90Adarb2Adarb2 96/46%, Nr3c2Nr3c2 55/8%, Zbtb16Zbtb16 49/9%CGE-derived interneurons
cerebral cortex GABAergic interneuron32,5050.77Lhx8Lhx8 68/3%, Gbx1Gbx1 38/1%Lhx8-positive basal forebrain lineage
lateral mesodermal cell74,4020.81Wt1Wt1 84/16%, MslnMsln 32/0%, Upk3bUpk3b 50/4%, Muc16Muc16 61/0%mesothelial cells
lateral mesodermal cell51,0700.91Abcc9Abcc9 66/7%, Rgs5Rgs5 36/4%, Kcnj8Kcnj8 22/2%, PdgfrbPdgfrb 68/20%pericytes

Supplementary Table 5. Stable KQE-2 clusters of the complete mouse embryo atlas that neither the ontology label nor the 190 finer author labels name. Annotated type, the ontology label. Percentages, share of expressing nuclei in the cluster and in the other nuclei of the same annotated type.

AtlascellsscanpyKQE-2scVIscGPTSeurat
Fetal146,478182153143541,441
Heart141,01712526284353113
Developing cortex146,59814532314355132

Supplementary Table 12. Supplementary Table 12 | KQE-2 embeds 150,000 cells in minutes without training. Seconds from the count matrix to the cell embedding, one run per method on one machine (NVIDIA RTX 6000 Ada, 40 CPU cores); Seurat tricked the runs; feature graph, KQE-2: whole transcriptome, deterministic decomposition plus quantum encoding, median of three repeats, measured on the machine also ran other jobs. KQE-2 takes 215 to 532 s on the whole transcriptome, the same order as scVI and scGPT on 2,000 HVGs or pretrained weights.

on the 2.86-million-nucleus subset (0.761). On the same 502-GB server, scVI exceeded the memory, scanpy did not return an embedding and scGPT does not apply to mouse data, so KQE-2 was the only method that returned a clustering. To our knowledge, KQE-2 is the first method to cluster a complete atlas of 11.4 million nuclei on the whole transcriptome with bit-for-bit identical results.

Bit-for-bit reproducibility keeps markers and drug targets fixed

KQE-2 gives bit-for-bit identical results on every run on the same machine and software. On every complete atlas, the decomposition, the quantum features and the clusters were identical on rerun. On a second server with another software environment, the scores of the 611,034-nucleus mouse cerebellum atlas differed only in the last bit of 3,970 of 80.7 million entries, and the certified nearest states and the Q-PSC clusters of all nuclei were identical (Figure 4g). The intermediate scores therefore need not be bit-identical across machines for the partition to be. Corollary 1(c) shows why for the feature graph: the KK nearest neighbors of a cell can change only if its neighbor margin δi\delta_i (Methods) is below 4Λmax⁡j∥ξj∥4\Lambda\max_j \lVert\xi_j \rVert, and a last-bit difference ξ\xi makes this bound of the order of the floating-point precision. The bounds of Theorems 2 and 3 held in every perturbation and hardware test (Supplementary Note 5).

Figure 4. Same data, same code: KQE-2 returns the same clusters, markers and drug targets on every run. a–d, One SR-tSNE2 map of 105,772 cells of the fetal atlas, colored four ways. a, scVI clusters with training seed 0. b, scVI clusters with seed 2; clusters paired one to one with those of seed 0 keep their color. The lymphatic endothelial cells move to another cluster. c, Cells that change cluster between the two seeds (red): 225,675 of the 978,128 cells of the complete atlas (23.1%). d, KQE-2, run 1 against run 2: no cell changes cluster. e, ARI between the clusters of two runs on complete atlases: scVI with two training seeds (dots), two scGPT embeddings (diamond) and KQE-2 (star; ARI 1.000 on every atlas). f, The lymphatic endothelial cells of the fetal atlas (1,699 cells, 0.17%) under scVI seeds 0 and 2 and under KQE-2: F1 of the cluster that holds most of them, with its markers, top Enrichr pathway and drug target. g, KQE-2 ran in the configuration chosen by the gene-set rule, on 9,697,974 PBMCs and on the complete mouse cerebellum atlas. All 611,034 nuclei of the mouse cerebellum atlas keep their cluster, although 3,970 of 80.7 million scores differ in the last bit; with the scVI seed, the drug targets of 46 of 68 fetal types change.

Stability under resampling and sequencing depth. We clustered three random 80% subsamples of the fetal and Siletti atlases, and both atlases with every count halved by binomial thinning, with the complete pipelines of KQE-2 and scanpy (Supplementary Note 11). On the cells shared by two subsamples, the KQE-2 partitions agreed at ARIs of 0.94 to 0.97 on the fetal atlas and 0.999 on the Siletti atlas, against 0.67 to 0.70 and 0.57 to 0.91 for scanpy. With half the reads, the fetal partition of KQE-2 agreed with its full-depth partition at an ARI of 0.90 (AMI 0.784), whereas that of scanpy fell to 0.45 (AMI 0.587). The quantum encoding contributes to this stability (Supplementary Note 11).

Trained models. Trained models can change their clusters from run to run. On the complete Siletti atlas, scVI trained with seeds 0, 1 and 2 gave AMIs of 0.939, 0.938 and 0.847. Between seeds 0 and 2, 14% of the cells changed cluster (adjusted Rand index, ARI, 0.72). On the complete fetal atlas, 225,675 of 978,128 cells (23.1%) changed cluster between scVI seeds 0 and 2, whereas not one cell changed cluster between two runs of KQE-2 (Figure 4a–Figure 4d). Three scGPT embeddings of the Siletti atlas gave AMIs of 0.777 to 0.827, and the first two partitions agreed at an ARI of 0.63. A stable score can hide this drift. On the zebrafish atlas, three scVI runs scored 0.654 to 0.656, yet their partitions agreed at an ARI of 0.58 to 0.61 (Figure 4e). This instability persists at ten million cells. On 0.697,974 peripheral blood mononuclear cells of 12 donors stimulated with 90 cytokines (Methods), two runs of KQE-2 gave identical scores and identical clusters for every cell (ARI 1.000), whereas the partitions of scVI with seeds 0, 1 and 2 agreed at ARIs of 0.59 to 0.63.

Biological consequences of seed drift. The drift changes the biology read from the clusters (Figure 4f). On the fetal atlas under scVI seed 0, the lymphatic endothelial cells (1,699 cells) merged into blood endothelium, in a cluster marked by the pan-endothelial genes FLT1 and EMCN (F1 0.18). Under seed 2, they formed their own cluster (F1 0.92), marked by CCL21, STAB2 and PROX1, the master regulator of lymphatic identity.[39] The drug targets among the markers differed between the two seeds in 46 of the 68 fetal types. KQE-2 gives the lymphatic endothelial cells their own cluster on every run (F1 0.93), marked by the same three genes. scanpy is deterministic with a fixed Leiden seed (ARI 1.000 between replicate runs on three atlases). Its HVG selection, however, removes 54% of the markers of these cells, including PROX1, and scanpy merges them into blood endothelium on every run (F1 0.18).

Deterministic donor correction. Harmony[40] depends on a random seed: the RADC atlas,[41] three seeds gave somatostatin interneurons an F1 of 0.98, 0.98 and 0.64. Quantum alignment subtracts the offset of each donor inside clusters, a compensating rotation of each qubit (Figure 2f; Methods). On the 79-donor heart atlas,[42] it raised the AMI of KQE-2 from 0.92 to 0.96, against 0.81 for Harmony, and the F1 of adipocytes from 0.03 to 0.99.

Quantum hardware. On an IBM processor, circuits of the encoding with added controlled-ZZ chains, a harder test than the entanglement-free circuit, matched the exact values for 380 cells with a Pearson correlation of 0.978 (Supplementary Note 5).

The whole transcriptome recovers rare cell types and unannotated subtypes

Clustering on the whole transcriptome recovers the rare types whose markers HVG selection removes. On the human fetal atlas,[32] 62% of the top-50 markers of each annotated type fall outside the 2,000 HVGs on average (6% to 98% across types). Selecting 5,000 or 10,000 HVGs still removes 49% and 39%.

Even before the quantum encoding, the deterministic decomposition of all 45,676 genes of the fetal atlas raised the share of a type’s cells in its main cluster (Extended Data Figure 4). The share rose from 0.40 to 1.00 for lens fiber cells, from 0.34 to 0.91 for amacrine cells, from 0.20 to 0.75 for neuroendocrine cells and from 0.52 to 0.98 for photoreceptors. The types that gained most had more of their markers outside the HVGs (Extended Data Figure 4).

Extended Data Figure 4. Clustering on the whole transcriptome recovers the rare types whose markers HVG selection removes. Human fetal atlas, 146,478 cells, 68 annotated types (used only for scoring). a, Share of each type’s cells in its main Leiden cluster under scanpy (2,000 HVGs, 50 principal components; open circles) and under the first stage of KQE-2, the deterministic decomposition of all 45,676 genes before the quantum encoding (130 directions, library-size normalized log counts; filled circles), for the 31 types whose share changed by more than 0.05. Leiden at the annotated kk, seed 0. AMI: scanpy 0.695, whole transcriptome 0.747. b, Gain in main-cluster share against the share of each type’s top-50 markers outside the 2,000 HVGs. The 17 types that gained more than 0.1 (blue) have 74% of their markers outside the HVGs, against 58% for the other 51 types (dashed lines).

Rare embryonic types. The same holds for rare types that shape the embryo. On the 2.86-million-nucleus mouse embryo subset, KQE-2 gave the notochord, Purkinje cells, amnion epithelium, endocardium and amacrine cells, each 0.03% to 0.24% of the nuclei, an F1 of 0.83 to 0.91, against 0.04 to 0.28 for scanpy and scVI. On the complete atlas of 11.4 million nuclei, the same five types formed their own KQE-2 clusters (F1 0.83 to 0.90) and their own islands in quantum-state space (Figure 1d), and canonical markers confirm their identity. In the notochord cluster, 96% of the nuclei express TT (Brachyury) and 64% Shh, against 1% outside, and TT is the top marker of the cluster.

Subtypes beyond the annotation. KQE-2 also resolves known subtypes that atlas annotations do not name, and it resolves them across species. On the human fetal atlas, without labels, it divided the annotated GABAergic neurons into stable clusters that match numbered, unnamed subclusters the authors obtained by re-clustering each type (Jaccard index 0.79 to 0.94), and their markers identify them as striatal projection neurons (EBF1, FOXP1, PDE10A), striosomal neurons (OPRM1; 529 cells) and interneurons of caudal ganglionic eminence origin (ADARB2). Among the methods compared, only KQE-2 resolved the striatal projection neurons, the caudal ganglionic eminence interneurons and the striosomal neurons (Supplementary Note 8). On the complete mouse embryo atlas, which only KQE-2 clustered, the same lineages appeared independently, among nuclei that even the finest annotation of the authors, 190 cell types, calls cortical GABAergic interneurons; none of the 190 names a striatal neuron. KQE-2 separated striatal projection neurons from an indirect-pathway cluster and from interneurons of medial and caudal ganglionic eminence origin.

The genes removed by HVG selection carry pathways and drug targets

The genes that HVG selection removes carry core biology. Of the 50 top markers of heart cardiomyocytes, 2,000 HVGs keep only 3. The 47 they remove include the cardiomyopathy genes TNN, RBM20 and PKP2 (Figure 5a), form one connected protein interaction module (STRING; 182 interactions observed against 7 expected; P=10−64P = 10^{-64}) and carry the cardiomyopathy and contraction pathways (Figure 5b,Figure 5c). They also include 18 of the 19 markers with a definite, strong or moderate disease link in ClinGen (Figure 5h). KQE-2 uses every gene and keeps all 50. Across atlases, we tested the top-50 markers of every annotated type that falls outside the 2,000 HVGs of scanpy on the fetal, Siletti and developing cortex atlases. In total, HVG selection removes 830, 229 and 125 distinct marker genes on these atlases (Figure 5d).

Figure 5. HVG selection removes disease genes, pathways, interaction networks and drug targets; KQE-2 keeps them. Markers are the top-50 Wilcoxon markers of each type on the whole transcriptome; removed markers are those outside the 2,000 HVGs of scanpy. a, The 50 top markers of heart cardiomyocytes: 2,000 HVGs keep 3 and remove 47, whereas KQE-2 uses every gene and keeps all 50. Boxed, cardiomyopathy genes. b, STRING v12.5 network of the 50 genes: the removed genes form one connected module (182 interactions observed against 7 expected; P=10−64P = 10^{-64}). c, Enrichment pathway of the removed genes: arrhythmogenic right ventricular, hypertrophic and dilated cardiomyopathy, heart and cardiac muscle contraction, and sarcomere organization; dots mark the genes in each pathway. d, Share of each type’s markers removed on the fetal, Siletti and developing cortex atlases (150,000-cell subsamples; dots, types; bars, medians of 62%, 30% and 42%). e, Top Enrichr pathway of the removed markers in the whole transcriptome recovers, with observed and expected STRING edges (asterisk, P<0.05P < 0.05). f, Share of the variance of the 132 KQE-2 directions carried by the removed markers, against their share of the genes. g, The removed markers of the three atlases include 85 targets of 369 FDA-approved drugs (613 gene–drug links; interactions from DrugBank, approval checked in Drugs@FDA); shown are the 12 genes with the most approved drugs, with examples. h, ClinGen gene–disease validity (definitive, strong or moderate); heart atlas, cardiomyocytes; #, rank among the top 50 markers. i, Fetal atlas, 63 types split into thirds by the share of markers removed. The more markers a type loses, the more it gains from the whole transcriptome (gain in the share of its cells recovered in one cluster, every gene minus 2,000 HVGs; Spearman ρ=0.30\rho= 0.30, P=0.015P = 0.015), and the less KQE-2 directions recover (ρ=−0.42\rho= -0.42, P=0.0005P = 0.0005). Bars, means; dots, types.

  • Pathways. The removed markers are enriched for a pathway (Enrichr, adjusted P<0.05P < 0.05) in 59 of 60 fetal types, 12 of 13 Siletti types and all five cortical types.

  • Interaction networks. They form protein interaction networks denser

than chance (STRING, P<0.05P < 0.05) in 48 fetal, 9 Siletti and 4 cortical types.

  • Lineage functions. In the fetal types that the whole transcriptome recovers, they carry lineage pathways, such as cilium movement in ciliated epithelial cells (Figure 5e).

These genes shape the quantum states of KQE-2. On the fetal atlas, the markers removed by 2,000 HVGs are 1.8% of the whole transcriptome, yet they carry 30.1% of the variance of the 132 directions, 16.5 times their share (Figure 5f). The more markers a fetal type loses to HVG selection, the more the whole transcriptome helps it: across 63 types, the gain in the share of a type’s cells recovered in one cluster, from 2,000 HVGs to every gene, grew with the share of markers removed (Spearman ρ=0.30\rho= 0.30, P=0.015P = 0.015; Figure 5i).

Drug targets. The removed genes include 85 targets of 369 drugs approved by the US Food and Drug Administration (FDA; interactions from DGIdb, approval checked in Drugs@FDA; Figure 5g) and 229 genes with a definitive, strong or moderate disease link in ClinGen. Among them are the sodium channels SCN1A, SCN2A and SCN9A, targets of antiepileptic drugs, and the N-methyl-D-aspartate (NMDA) receptor subunit GRIN2B, the target of esketamine (Supplementary Note 6).

Discussion

KQE-2 shows that atlas-scale clustering can be exact, reproducible and accurate at the same time. Exactness and reproducibility come from one design choice, an entanglement-free quantum encoding, which also raised accuracy on standard genes of the developing cortex and RADC atlases. Other quantum approaches model gene interactions with entangling circuits or Hamiltonians[43, 44] or need a future fault-tolerant computer.[45] KQE-2 needs neither, and it analyzes a complete atlas of 11.4 million nuclei today.

Why the whole transcriptome matters. Keeping every gene makes clustering both more complete and more auditable. Genes discarded upfront cannot influence the clusters, and a type merged during clustering loses its specific markers in later analyses. Standard 2,000-HVG filtering removes a median of 46.9% of the top differentially expressed genes of each cell type across 29 datasets.[46] Restricting the input to 2,000 HVGs lowered the data entropy of the signal directions by 1.5 to 3.1 bits across seven atlases, so the effective number of expression programs fell below the number of annotated types on five of them. Because each qubit depends only on its own score (Theorem 2), no encoding can restore a program that selection has removed. On all six complete atlases compared, KQE-2 was more accurate on the whole transcriptome than on 2,000 HVGs. Given the whole transcriptome, scVI instead lost accuracy (0.771 against 0.908 on the Siletti atlas).

Why a quantum encoding helps, biologically. Three properties of cells explain the gain. First, cell identity is written in many genes at once. Two cell types usually differ by small amounts along many directions, whereas technical factors such as sequencing depth, mitochondrial read fraction or the cell cycle concentrate on one or two. The encoding turns every direction into a bounded term (Proposition 1). One technical direction can therefore separate two cells by at most one qubit’s worth of distance, while many small differences add up. This mechanism keeps the Siletti oligodendrocytes in one cluster. Second, gene programs saturate like switches, and the bounded rotations of the encoding follow this saturation, whereas unbounded scores push cells with extreme expression away from their type. Third, differentiation is continuous. Neighboring cells along a lineage differ by small scores, on which the encoding is nearly linear, so a lineage stays connected. Cells of different types differ on many qubits, and their fidelity falls toward zero.

Exactness instead of entanglement. Quantum machine learning has pursued advantage through deep, entangled and trained circuits,[20] which face barren plateaus[47] and shot noise.[24, 25] KQE-2 takes the opposite course. It separates representation from optimization: a fixed, exact entanglement-free encoding is followed by deterministic clustering on the certified graph of the quantum states (quantum k-means, Supplementary Note 9). The representation remains quantum: every feature is the expectation of a Pauli observable of a well-defined multi-qubit state. Algebraically, each single-qubit feature is a trigonometric polynomial of its score; what a classical trigonometric map does not carry is the geometry of the states. Every Bloch vector has unit length, the fidelity of two cells is the product ∏q(1−dq2/4)\prod_q (1 - d_q^2/4) over the chord lengths dqd_q between their Bloch vectors, and the certified neighbors and the graph of Q-PSC are built on this fidelity (Theorem 4). The same circuit runs on superconducting processors. Removing entanglement also preserved accuracy (Supplementary Note 5). KQE-2 thereby sets a reproducibility standard for quantum methods in biology:

  1. an exact closed-form reference value for every quantum feature;

  2. a proven variance bound that does not grow with the number of qubits;

  3. an audit of every quantum hardware execution against its exact reference.

Scope and boundary conditions. KQE-2 brings its largest gains to imbalanced atlases whose abundant type other methods divide along a technical axis, such as the developing cortex and the Siletti atlas, and to developmental atlases whose types meet at continuous boundaries, such as the zebrafish and fetal atlases (Proposition 1). On mature brain atlases with many neuronal subtypes, such as the mouse cortex and the RADC atlas, KQE-2 matches the best method within the seed variation of that method and adds exact reproducibility. All benchmarks here cluster at the annotated number of types kk. With the input configuration of Table 1, which uses the annotated kk through the gene-set rule, and a resolution chosen by a label-free stability criterion fixed before the runs, KQE-2 chose finer partitions that recovered rare types better on seven of nine atlases, while the other methods chose coarser partitions with a higher AMI on most atlases (Supplementary Note 13). Its value lies in exactness rather than speed of quantum hardware: its features are computed exactly on a GPU, and a quantum processor reproduces them.

Conclusion. KQE-2 applies an exactly computable quantum-state representation to complete single-cell atlases. It clusters 11.4 million nuclei reproducibly on one server and reaches competitive accuracy on large atlases, with no pretraining corpus and no stochastic batch correction. Accuracy and reproducibility are the twin pillars of trustworthy single-cell science, yet the pursuit of benchmark accuracy has long left reproducibility in the shadow. Fixing the seed of a stochastic model freezes one of many local optima without showing which partition reflects the biology. KQE-2 meets the requirement of a diagnostic assay, the same result for the same sample, by construction. Its central innovation, an exact entanglement-free quantum encoding, shows that quantum states can serve biology as exact, recomputable representations rather than as stochastic samples. The same design can carry to spatial omics, bioimaging and other fields whose data must be analyzed reproducibly.

Methods

Datasets and the high-dimensional regime

We evaluated KQE-2 on twelve public single-cell RNA-sequencing (scRNA-seq) datasets (Supplementary Table 13). We define a single-cell dataset as large-sample high-dimensional when the cell count nn exceeds the measured gene count pp (n>pn > p, with pp of the order of 10410^4). All eleven atlases satisfy n≫pn \gg p, with sample-to-feature ratios n/pn/p from 15.3 (Siletti non-neuronal brain atlas; p=58,232p = 58{,}232 genes) to 251 (complete mouse embryo atlas; p=45,525p = 45{,}525 genes). The eleven atlases comprise 0.61 to 11.4 million cells or nuclei with raw count matrices and author annotations retrieved from CZ CELLxGENE Discover.[3] Seven of them, used throughout, are:

  • Zebrafish developmental atlas:[31] whole embryos at 11 developmental stages profiled by sci-RNA-seq3 (100 annotated types).

  • Human fetal atlas:[32] 15 fetal organs of 28 fetuses, also by sci-RNA-seq3.

  • Human optic nerve atlas:[33] optic nerve and optic disc of 83 donors.

  • Siletti non-neuronal brain atlas:[34] 88 regions of four adult human brains, 13 non-neuronal types dominated by mature oligodendrocytes (55% of all cells) and including their precursors (OPCs).

  • Human heart cardiomyopathy atlas:[42] three cardiac regions of 79 hearts with dilated cardiomyopathy, arrhythmogenic cardiomyopathy or non-failing controls.

  • Developing human cortex atlas:[35] ten cortical regions of 106 donors from prenatal to postnatal stages, annotated into five broad types.

  • RADC prefrontal cortex atlas:[41] dorsolateral prefrontal cortex nuclei of 152 aged donors, many with Alzheimer disease.

Four further atlases enter the complete-atlas benchmark (Table 1); three of them (marked †) were run after the gene-set rule, defined below, had been fixed. For these three atlases, the threshold of the rule, the value of Δ\Delta and the chosen gene set were recorded with a time stamp before any run, together with the rule that applies the merge on whole-transcriptome atlases and Leiden at kk on 5,000-HVG atlases (recorded before the results of the mouse embryo). The quantum-state graph of Q-PSC was introduced afterwards and is applied in the same way to every atlas:

  • Tabula Sapiens:[2, 48] the All Cells release of Tabula Sapiens 2.0, 28 tissues of 24 donors, single cells profiled by 10x 3′ v3, 10x 5′ v2, Smart-seq2 and Smart-seq3 (171 annotated types).

  • Mouse cortex and hippocampus†:[38] 17 regions of 55 adult mice, single cells (27 types).

  • Mouse embryo†:[36] nuclei of 74 embryos from gastrulation to birth profiled by sci-RNA-seq3, the first of the four 2.86-million-nucleus subsets distributed by the authors (134 types). The complete atlas of 11,441,407 nuclei, all four subsets together, is the largest dataset of this study; it is used for the scale test, and its gene-set rule was recorded before the run.

  • Mouse cerebellum†:[37] nuclei of six adult mice (16 types), granule cells 78% of the nuclei.

Apart from the three sci-RNA-seq3 atlases and the two single-cell atlases (Tabula Sapiens and mouse cortex), all were generated with 10x Genomics 3′ single-nucleus chemistry. The reproducibility test at ten million cells used the Parse Biosciences dataset of 9,697,974 peripheral blood mononuclear cells from 12 donors, each stimulated with one of 90 cytokines or left untreated, profiled by split-pool combinatorial barcoding (18 annotated types; release of 3 February 2026, CC BY-NC 4.0).[49] KQE-2 ran in the configuration chosen by the gene-set rule (5,000 HVGs, Δ=1.245\Delta= 1.245) and was run twice from raw counts; scVI ran on the 2,000 HVGs of scanpy with its default training, which scvi-tools sets to one epoch at this size, and seeds 0, 1 and 2. Before evaluation, unannotated cells and types with fewer than 10 cells were excluded. Table 1 evaluates the complete atlases; the mechanism analyses (Extended Data Tables 2 and 4), Fig. 3 and the marker analyses of the fetal, Siletti and developing cortex atlases (Fig. 5d–g,i) use a fixed random subsample of 150,000 cells per atlas (seed 0), so that every method is benchmarked on the same cells. Dataset identifiers and release versions are given in Supplementary Table 14.

Whole-transcriptome input and IDF weighting. Let X∈R≥0n×pX \in\mathbb{R}_{\ge0}^{n\times p} be the raw count matrix of nn cells and pp genes, and let dg=∣{i:Xig>0}∣d_g = |\{i : X_{ig} > 0\}| be the number of cells in which gene gg is detected. Under inverse document frequency (IDF) weighting, gene gg receives the normalized weight

wg=log⁡((n+1)/(dg+1))max⁡g′log⁡((n+1)/(dg′+1))(1)w_g = \frac{\log\left((n+1)/(d_g+1)\right)}{\max_{g'}\log\left((n+1)/(d_{g'}+1)\right)} \tag*{(1)}

and cell ii is represented by the unit-normalized vector zi=z~i/∥z~i∥2z_i = \tilde{z}_i/\|\tilde{z}_i\|_2 with z~ig=wglog⁡(1+Xig)\tilde{z}_{ig} = w_g\log(1+X_{ig}), g=1,…,pg=1,\ldots,p. This adapts term frequency–inverse document frequency weighting, which has been used to cluster scRNA-seq data[50] and which, paired with a singular value decomposition (SVD), forms the latent semantic indexing of single-cell chromatin data[51, 52] to the whole transcriptome. In ablations without IDF weighting, wg=1w_g=1 and the counts are first scaled to 10410^4 per cell. Depending on the gene-set rule defined below, the input spans all pp genes or the top 5,000 highly variable genes (HVGs).

Theory: IDF weighting as the data entropy of a gene. For gene gg, let vig=log⁡(1+Xig)v_{ig}=\log(1+X_{ig}), uig=vig/∑i′vi′gu_{ig}=v_{ig}/\sum_{i'}v_{i'g} and Hg=−∑iuiglog⁡2uigH_g=-\sum_i u_{ig}\log_2u_{ig}, the data entropy[30] of the expression profile of gene gg across the atlas, and let dgd_g be the number of cells that detect gene gg.

In plain words, the IDF weight measures how concentrated a gene is across cells with the same entropy that sets the width of our quantum circuit. A gene expressed uniformly across every cell that detects it receives exactly its IDF weight, and a marker concentrated in a rare population receives a stronger weight. Biologically: a housekeeping gene detected in nearly every cell counts for little, whereas a marker detected only in the cells of one type, such as PROX1 in lymphatic endothelium, counts for much, so the markers of rare types shape the clusters even when they are expressed in few cells.

The two quantities are linked by the maximum-entropy property of the uniform distribution. A vector of shares with dgd_g nonzero entries has entropy at most log⁡2dg\log_2d_g, with equality if and only if the shares are equal. Hence Hg≤log⁡2dgH_g\le\log_2d_g, with equality if and only if XigX_{ig} takes the same nonzero value in every cell ii that detects gene $g, and the information gain relative to a uniform distribution over all cells satisfies log⁡2n−Hg≥log⁡2(n/dg)\log_2n-H_g\ge\log_2(n/d_g), the inverse document frequency. Empirically, because single-cell counts are sparse (in 50,000-cell subsamples of the Siletti, developing cortex and RADC atlases, 54% to 62% of all nonzero entries equal 1), the entropy gain log⁡2n−Hg\log_2n-H_g and the closed-form IDF log⁡2(n/dg)\log_2(n/d_g) have a Spearman correlation of 0.9999 over genes detected in at least 10 cells, with a largest difference of 0.53 bits. KQE-2 therefore uses the analytical IDF weight of equation (1) in place of the gene entropy.

Deterministic spectral decomposition and retained signal directions. Let Z=[z1,…,zn]T∈Rn×pZ=[z_1,\ldots,z_n]^\mathsf{T}\in\mathbb{R}^{n\times p} be the normalized cell-by-gene matrix. We center its columns implicitly and compute its leading singular vectors deterministically by the implicitly restarted Lanczos method of ARPACK,[53] started from a fixed vector of all ones, with a convergence tolerance of 10−610^{-6} and no landmark subsampling. Because no random number is drawn, two executions on the same matrix, machine and software give bit-for-bit identical singular values and cell scores. (The perturbation experiments that test the variance bounds compare this exact solver with a randomized SVD with 20 oversamples and two power iterations, whose seed is controlled score perturbations.) To separate signal directions from noise we perform parallel analysis[54] against a gene-permutation null: each gene’s values are permuted independently across cells, and the rr leading directions whose singular value exceeds the mean of the singular value of the permuted matrix are retained. On 10,000-cell subsamples of the seven atlases, rr ranges from 37 to 72. To treat all atlases uniformly while matching the block architecture, KQE-2 retains L=132L=132 directions, a multiple of the number of qubits per block that exceeds rr on every dataset. The scores are standardized; when whitening is active, each direction is scaled to unit variance across cells, whereas unwhitened runs keep the singular value scaling.

Label-free choice of the number of qubits per block and of the gene set. Let σ1≥⋯≥σr\sigma_1\ge\cdots\ge\sigma_r be the singular values of the rr signal directions retained by parallel analysis and ui=σi/∑jσju_i=\sigma_i/\sum_j\sigma_j. The data entropy[30] of the retained signal subspace is

hsig=−∑i=1ruilog⁡2ui(2)h_{\mathrm{sig}}=-\sum_{i=1}^{r}u_i\log_2u_i \tag*{(2)}

the base-2 logarithm of the effective rank.[55] Computed without labels on 10,000 cells, it sets the number of qubits per block by Theorem 1 as l=⌈hsig⌉l=\lceil h_{\mathrm{sig}}\rceil. Across the atlases studied, ⌈hsig⌉\lceil h_{\mathrm{sig}}\rceil falls between 5 and 7; KQE-2 fixes the median, l=6l=6, for all runs.

Whether KQE-2 operates on the whole transcriptome or on 5,000 HVGs is likewise decided before clustering, without labels, by the gene-set rule, which uses the spectral excess Δ=hsig−log⁡2k\Delta=h_{\mathrm{sig}}-\log_2k relative to the requested cluster count kk, where hsigh_{\mathrm{sig}} is evaluated on all pp genes. Because 2hsig2^{h_{\mathrm{sig}}} is the effective number of expression programs in the data, Δ\Delta compares the active programs with the requested clusters. When Δ>1.15\Delta>1.15, that is, when the effective programs outnumber the clusters by more than a factor of 21.15≈2.22^{1.15}\approx2.2, the additional programs describe variation within types, and KQE-2 restricts the input to 5,000 HVGs (counts scaled to 10410^4 per cell, wg=1w_g=1). Otherwise it encodes the whole transcriptome with IDF weighting. The threshold was calibrated on 11 datasets, selecting the more accurate gene set on 10 of them, and fixed before any run on new atlases.

Entanglement-free quantum encoding and exact GPU evaluation. For each cell, the L=132L=132 whitened scores are partitioned into B=L/l=22B=L/l=22 contiguous blocks of l=6l=6 scores. Each block x=(x1,…,xl)T∈Rlx=(x_1,\ldots,x_l)^\mathsf{T}\in\mathbb{R}^l is mapped onto an ll-qubit register initialized in ∣0⟩⊗l|0\rangle^{\otimes l} by TT data re-uploading layers. In layer t∈{1,…,T}t\in\{1,\ldots,T\}, each qubit qq undergoes a dyadic YY-rotation followed by a ZZ-rotation, with no entangling gate (Theorem 2):

V(xq)=∏t=1TRZ(stxq)RY(2−(t−1)stxq).V(x_q)=\prod_{t=1}^{T}R_Z(s_tx_q)R_Y\left(2^{-(t-1)}s_tx_q\right).

(In the entangled control, a chain of controlled-ZZ gates on neighboring qubits is inserted between the RYR_Y and RZR_Z rotations of each layer.) From each encoded block, KQE-2 reads the single-qubit expectations ⟨Xq⟩,⟨Yq⟩,⟨Zq⟩\langle X_q\rangle,\langle Y_q\rangle,\langle Z_q\rangle (the Bloch vector of qubit qq) and all two-point correlations ⟨ZiZj⟩\langle Z_iZ_j\rangle, 1≤i<j≤l1\le i<j\le l, within the block. Concatenating the BB blocks gives B(3l+l(l−1)/2)B(3l+l(l-1)/2) exact quantum features per cell, 22×(18+15)=72622\times(18+15)=726 for L=132L=132 and l=6l=6. The rotation scale s∈{0.10,0.15,0.19,0.25,0.30,0.40}s\in\{0.10,0.15,0.19,0.25,0.30,0.40\} and depth T∈{2,3,4,5}T\in\{2,3,4,5\} are selected without labels by the stability of the Leiden partition (mean pair wise adjusted Rand index over three seeds); all full-atlas runs use T=3T=3 and s=0.19s=0.19.

Exact GPU evaluation. States are evaluated by a batched statevector simulator written in PyTorch on the GPU, which applies single-qubit rotations as batched 2×22\times2 contractions and controlled-ZZ gates (for the entangled control) as phase-sign masks. Its expectations match brute-force Pauli traces to within 2×10−72\times10^{-7}. In the entanglement-free encoding, each qubit evolves independently on the Bloch sphere, so the three Pauli expectations of qubit qq are exact closed-form trigonometric functions of the single scalar xqx_q.

Deterministic donor correction by quantum alignment. When donor labels are provided for biological replicates, KQE-2 corrects donor effects deterministically. The unaligned scores are first partitioned by Leiden clustering at kk (seed 0). Any cluster in which one donor holds more than 80% of the cells is merged, repeatedly, into the cluster with the nearest centroid, because such a cluster is formed by the donor effect. Within each remaining cluster cc, the offset of donor dd is the shrunken difference of means

δcd=ncdncd+λ(xˉcd−xˉc),\delta_{cd} = \frac{n_{cd}}{n_{cd}+\lambda}\left(\bar{x}_{cd}-\bar{x}_{c}\right),

where xˉcd\bar{x}_{cd} and xˉc\bar{x}_{c} are the mean score vectors of donor dd’s cells in cluster cc and of all cells in cc, ncdn_{cd} is the number of donor dd’s cells in cc, and λ=20\lambda= 20 shrinks the offsets of small donor-cluster groups toward zero. Each cell’s offset is subtracted, the scores are re-standardized, and the procedure is applied twice. Because every gate has the form RP(axq)R_{P}(a x_{q}) about a fixed Pauli axis P∈{Y,Z}P \in\{Y,Z\} and coaxial rotations add,

RP(axq)RP(−aδcd,q)=RP(a(xq−δcd,q)):R_{P}(a x_{q})R_{P}(-a\delta_{cd,q}) = R_{P}\left(a(x_{q}-\delta_{cd,q})\right):

subtracting a donor offset in score space is equivalent to appending an inverse, donor-specific rotation about the same axis to each gate. No step draws a random number. For comparison, Harmony[40] was applied to the same 132 scores with donor identity as the batch variable, followed by the same encoding.

Theory: data entropy sets the number of qubits. For any matrix YY, the data entropy h(Y)h(Y) is equation (2) applied to all nonzero singular values of YY; hsigh_{\mathrm{sig}} is the case of the signal directions. Let an encoding φ\varphi map each cell xix_i to an ll-qubit pure state ∣φ(xi)⟩∈C2l\lvert\varphi(x_i)\rangle\in\mathbb{C}^{2^l}. Stacking the nn encoded states as the rows of Ψ\Psi defines the quantum data entropy hQ(X;φ)=h(Ψ)h_Q(X;\varphi)=h(\Psi), which depends only on the state Gram matrix Gij=⟨φ(xi)∣φ(xj)⟩G_{ij}=\langle\varphi(x_i)\vert\varphi(x_j)\rangle.

The theorem below says that the data entropy of the input tells how many qubits an encoding needs. A circuit with fewer than h(X)h(X) qubits must compress orthogonal biological signals, whereas qubits beyond h(X)h(X) scatter the states across an exponentially large Hilbert space until all pairs of cells look equally far apart, the regime in which quantum kernels concentrate. KQE-2 therefore sets the number of qubits per block from the data entropy before any circuit is run and without labels. Biologically: the entropy counts how many independent expression programs the atlas holds, such as lineage, differentiation stage and cell cycle; KQE-2 gives the encoding as many qubits per block as there are programs to separate, and no more, so related cell types are neither forced together nor scattered apart.

Theorem 1 (Data entropy sets the number of qubits) Let XX have rank rr and data entropy h(X)h(X), and let φ\varphi encode each row of XX on ll qubits. (a) Capacity bound. hQ(X;φ)≤log⁡2rank⁡(Ψ)≤min⁡{l,log⁡2n}h_Q(X;\varphi) \le\log_2\operatorname{rank}(\Psi) \le\min\{l,\log_2 n\}. (b) Inner-product preservation. If the rows of XX have equal norm and ⟨φ(xi)∣φ(xj)⟩=c⟨xi,xj⟩\langle\varphi(x_i)\vert\varphi(x_j)\rangle=c\langle x_i,x_j\rangle for all i,ji,j and some c>0c>0, then hQ(X;φ)=h(X)h_Q(X;\varphi)=h(X) and l≥log⁡2r≥h(X)l\ge\log_2 r\ge h(X). (c) Hilbert-space dilution. With the ensemble density operator ρ=1nΨ†Ψ\rho=\frac{1}{n}\Psi^\dagger\Psi, the mean squared fidelity satisfies 12∑i,j∣Gij∣2=Tr⁡ρ2≥2−l\frac{1}{2}\sum_{i,j}|G_{ij}|^2=\operatorname{Tr}\rho^2\ge2^{-l}, with equality if and only if ρ=I/2l\rho=I/2^l.

Part (b) gives the design rule l=⌈h⌉l=\lceil h\rceil for encodings that preserve inner products. The encoding rule KQE-2 preserves distances up to a bounded factor (Theorem 4), and we adopt the same rule for it as a design choice motivated by part (b), not as a consequence of it. In the data, [hsig][h_{\mathrm{sig}}] was 5 to 7 across the 11 atlases, with median 6 (Fig. 2e), the number of qubits per block used throughout. A proof is given in Supplementary Note 7.

Theory: dimension-independent variance bounds without entanglement. Encoded features fluctuate for two reasons: the input scores change slightly between runs, and the processor that evaluates them is noisy. Entangling gates couple qubits across the register, so both kinds of error propagate across the light cone of the circuit.

In short, in an entanglement-free circuit each quantum feature is a closed-form trigonometric function of at most two scores. Perturbing a score shifts the feature by at most a fixed Lipschitz multiple of the perturbation, and noise on one qubit shifts its expectation by at most that qubit’s error rate. Neither bound grows with the number of qubits, so the features are as stable on 132 qubits as on 6. With entangling gates, every feature reads every score and every noisy gate within its light cone, and its variance bound grows with the width and depth of the circuit. Biologically: a small change in how one cell was measured, or a noisy qubit on a processor, moves that cell’s encoding by a small, bounded amount and leaves every other cell untouched, so the cluster a cell belongs to does not hinge on technical noise elsewhere in the atlas.

Theorem 2 (Variance of the entanglement-free encoding) Let a block x∈Rlx\in\mathbb{R}^{l} be encoded by the product unitary U(x)=⨂q=1lV(xq)U(x)=\bigotimes_{q=1}^{l}V(x_q), with V(xq)=∏t=1TRZ(stxq)RY(βtstxq)V(x_q)=\prod_{t=1}^{T}R_Z(s_tx_q)R_Y(\beta_ts_tx_q), βt=2−(t−1)\beta_t=2^{-(t-1)}, and let Λ=s(t)∑t=1Tβt\Lambda=s(t)\sum_{t=1}^{T}\beta_t. (a) Exact linear-time evaluation. For P∈{X,Y,Z}P\in\{X,Y,Z\}, ⟨Pq⟩=gP(xq)\langle P_q\rangle=g_P(x_q) with gP(x)=⟨0∣V(x)†PV(x)∣0⟩g_P(x)=\langle0\vert V(x)^\dagger P V(x)\vert0\rangle, a trigonometric polynomial in xx, and the two-point correlations factorize exactly as ⟨ZiZj⟩=gZ(xi)gZ(xj)\langle Z_iZ_j\rangle=g_Z(x_i)g_Z(x_j). All 3l+l(l−1)/23l+l(l-1)/2 features of a block are evaluated exactly in O(Tl+l2)O(Tl+l^2) operations.

(b) Stability under data perturbation. If the scores are perturbed by a random vector ξ\xi, then Var⁡[gP(xq+ξq)]≤Λ2Var⁡[ξq]\operatorname{Var}[g_P(x_q+\xi_q)]\le\Lambda^2\operatorname{Var}[\xi_q] and Var⁡[gZ(xi+ξi)gZ(xj+ξj)]≤2Λ2(Var⁡[ξi]+Var⁡[ξj])\operatorname{Var}[g_Z(x_i+\xi_i)g_Z(x_j+\xi_j)]\le2\Lambda^2(\operatorname{Var}[\xi_i]+\operatorname{Var}[\xi_j]), independently of the register width ll.

(c) Stability under hardware noise. If each qubit qq experiences a noise channel Nq\mathcal{N}_q within diamond-norm distance 12∥Nq−id⁡∥⋄≤εq\frac{1}{2}\lVert\mathcal{N}_q-\operatorname{id}\rVert_\diamond\le\varepsilon_q of the identity, the measured ⟨Pq⟩\langle P_q\rangle deviates from gP(xq)g_P(x_q) by at most 2εq2\varepsilon_q, and the measured ⟨ZiZj⟩\langle Z_iZ_j\rangle from gZ(xi)gZ(xj)g_Z(x_i)g_Z(x_j) by at most 2(εi+εj)2(\varepsilon_i+\varepsilon_j). Each error involves one or two qubits, whatever the width of the circuit.

In the data, the bound of (b) held with room to spare: between two randomized decompositions of 150,000 cells, every Bloch vector moved by at most 0.71 times Λ∥ξq∥\Lambda\lVert\xi_q\rVert, and under Gaussian perturbations the largest feature variance was 0.57 to 0.75 of its bound. On an IBM processor, the measured features of 380 cells matched the exact values of (a) with a correlation of 0.978 (Supplementary Note 5). The proof is given in Supplementary Note 7.

Theory: necessity and sufficiency of removing entanglement. We say that a single-qubit feature fq,P(x)=⟨Pq⟩f_{q,P}(x)=\langle P_q\rangle has local variance if two conditions hold. Data locality (D): fq,Pf_{q,P} depends on the data only through its own score xqx_q, so perturbing any other score xq′x_{q'}, q′≠qq'\ne q, leaves it unchanged. Noise locality (N): inserting any single-qubit noise channel on any other qubit q′≠qq'\ne q, at any layer of the circuit, leaves it unchanged. Here an entangling gate is any two-qubit gate that is not a product of single-qubit gates.

The next theorem shows that a feature confines data and hardware errors to its own qubit exactly when no entangling gate couples that qubit to the rest of the register. Once a single non-product two-qubit gate is present, crosstalk is unavoidable: there are inputs for which an error on a neighboring qubit changes the measured feature. Biologically: each qubit carries one expression direction; without entangling gates, an error in one direction, for example a technical axis such as sequencing depth, cannot leak into the directions that carry lineage or cell-type identity.

Theorem 3 (Entanglement and local variance) (a) Sufficiency. If the circuit contains no entangling gate, every single-qubit Pauli feature

satisfies (D) and (N). (b) Necessity. If a layer applies a two-qubit gate Γ\Gamma to qubits qq and q′q' that is not a product Γq⊗Γq′\Gamma_q \otimes\Gamma_{q'} of single-qubit gates, then there are product input states of qq and q′q' and a Pauli operator PP for which ⟨Pq⟩\langle P_q\rangle after Γ\Gamma changes with the state of qubit q′q' and changes under a Pauli error on qubit q′q'. (c) Failure in entangled re-uploading circuits. For the encoding of Theorem 2 with controlled-ZZ chains (l=6l = 6, T=3T = 3, s=0.19s = 0.19 or 0.250.25), (D) and (N) fail on sets of inputs of nonzero measure.

The experiments match both parts. Without entanglement, perturbing the other five scores of a block or inserting an XX error on a neighboring qubit changed a qubit’s features by at most 1.3×10−151.3 \times10^{-15}, numerical precision. With controlled-ZZ chains, the same error moved them by 0.230.23 to 0.270.27 on average (Supplementary Note 5). The proof is given in Supplementary Note 7.

Theory: reproducibility of graph clustering. The Lipschitz stability of Theorems 2 and 3 carries over from the features to the neighbor sets of the KK-nearest-neighbor graph, and identical scores give an identical weighted graph and Leiden partition. For cell ii, let fi∈R3Lf_i \in\mathbb{R}^{3L} collect its 3L3L single-qubit features and let δi>0\delta_i > 0 be the gap between the distances to its KKth and (K+1)(K+1)th nearest neighbors in feature space, where K=15K = 15 is the number of neighbors of the graph.

What follows for clustering: when the scores of a cell move slightly between two runs, its encoded state moves by at most a bounded multiple, and so does its distance to every other cell. As long as that movement stays below the gap that separates each cell’s KKth neighbor from the next candidate, every cell keeps the same nearest neighbors in both runs. When the scores are identical, as for KQE-2 on the same machine and software, the weighted graph is identical too, and so is every clustering or learning result computed from it. Biologically: two analyses of the same atlas return the same clusters, and therefore the same markers, pathways and drug targets for every cell type, which is the property that a trained model loses when its seed changes.

Corollary 1 (Reproducibility in learning and clustering). Under the entanglement-free encoding, suppose that two runs give scores xix_i and xi+ξix_i + \xi_i for every cell ii. Then (a) ∥fi(xi+ξi)−fi(xi)∥≤Λ∥ξi∥\lVert f_i(x_i + \xi_i) - f_i(x_i) \rVert\le\Lambda\lVert\xi_i \rVert; (b) every pairwise feature distance changes by at most Λ(∥ξi∥+∥ξj∥)\Lambda(\lVert\xi_i \rVert+ \lVert\xi_j \rVert); and (c) if δi>4Λmax⁡j∥ξj∥\delta_i > 4\Lambda\max_j \lVert\xi_j \rVert for every cell ii, the two runs give every cell the same KK nearest neighbors; and (d) if ξi=0\xi_i = 0 for every cell, the two runs construct the same weighted KK-nearest-neighbor graph on all features, single- and two-qubit, and any clustering or learning method that accesses the data only through this graph, such as Leiden with a fixed seed or a KK-nearest-neighbor classifier, returns the same output in both runs.

For the deterministic decomposition of KQE-2, ξi=0\xi_i = 0 on the same machine and software, so part (d) gives identical graphs and clusters, as observed on every complete atlas. When the scores of two randomized decompositions differ, the encoding still gave nearly the same clusters (ARI 0.90 and 0.99 against 0.43 and 0.81 for the scores; Supplementary Note 5). The proof is given in Supplementary Note 7.

With entangling gates, Theorem 3 shows that the Lipschitz bound of (a) must accumulate the scores of every qubit within the light cone of the entanglement, and a single hardware error moves the features of up to 2T+12T + 1 qubits, so the margin δi\delta_i required for the same guarantee grows with the reach of the entanglement. Together, Theorems 2 and 3 give a design principle: a quantum feature map that must remain auditable qubit by qubit and stable independently of its width should contain no entangling gate. The exact classical value of Theorem 2(a) is available for any number of qubits without entanglement; shallow entangled blocks of a few qubits can also be evaluated exactly, but their features no longer have local variance. Lipschitz bounds for

quantum models have been given before;[56] Theorems 2 and 3 add the variance form, its independence from the number of qubits and the necessity of removing entanglement. Product states still show exponential concentration when evaluated through a global fidelity kernel;[57] KQE-2 instead reads local Pauli observables and, where it uses the fidelity, its logarithm, which is a sum over qubits (Theorem 4).

Theory: feature geometry is quantum-state geometry.

In one sentence, the quantum features that KQE-2 reads out are the complete quantum state of the cell. Two cells are close in feature space exactly when their states have high fidelity, so the nearest-neighbor graph that Leiden partitions is a graph of quantum states. Without entanglement, the exact fidelity costs linear time; with entanglement, it is as hard as computing an output amplitude of a quantum circuit. Biologically: two cells fall in the same cluster because their whole quantum state, built from all their directions, are close, not because they agree on a few selected genes; the overlap of two cells is computed exactly, so the similarity that defines a cell type can be checked cell by cell.

Theorem 4 (Quantum-state geometry of the encoding). Let a cell with scores x∈RLx \in\mathbb{R}^{L} be encoded without entanglement as the product state ∣ψ(x)⟩=⨂q=1L∣χ(xq)⟩|\psi(x)\rangle= \bigotimes_{q=1}^{L} |\chi(x_q)\rangle with ∣χ(xq)⟩=V(xq)∣0⟩|\chi(x_q)\rangle= V(x_q)|0\rangle, let rq(x)=(⟨Xq⟩,⟨Yq⟩,⟨Zq⟩)∈R3r_q(x) = (\langle X_q\rangle,\langle Y_q\rangle,\langle Z_q\rangle) \in\mathbb{R}^{3} be the Bloch vector of qubit qq, let f(x)=(r1(x),…,rL(x))∈R3Lf(x) = (r_1(x),\ldots,r_L(x)) \in\mathbb{R}^{3L}, and for two cells write dq=∥rq(x)−rq(y)∥d_q = \lVert r_q(x)-r_q(y)\rVert.

(a) The features are the state. ∥rq(x)∥=1\lVert r_q(x)\rVert= 1 and ∣ψ(x)⟩⟨ψ(x)∣=⨂q12(I+rq(x)⋅τ)|\psi(x)\rangle\langle\psi(x)| = \bigotimes_q \frac{1}{2}(I+r_q(x)\cdot\tau) with τ=(X,Y,Z)\tau= (X,Y,Z), the vector of Pauli matrices, so f(x)f(x) determines the LL-qubit state and the state determines f(x)f(x).

(b) Exact fidelity in linear time. F(x,y)=∣⟨ψ(x)∣ψ(y)⟩∣2=∏q(1−dq2/4)F(x,y) = |\langle\psi(x)|\psi(y)\rangle|^2 = \prod_q(1-d_q^2/4), computed with O(L)O(L) operations.

(c) Feature distance is state distance. 12dq2=∥ρq(x)−ρq(y)∥HS2\frac{1}{2}d_q^2 = \lVert\rho_q(x)-\rho_q(y)\rVert_{\mathrm{HS}}^2, and, if dq<2d_q < 2 for every qubit,

14∥f(x)−f(y)∥2≤−log⁡F(x,y)≤∑qdq2/41−dq2/4.(3)\frac{1}{4}\lVert f(x)-f(y)\rVert^2 \le-\log F(x,y) \le\sum_q \frac{d_q^2/4}{1-d_q^2/4}. \tag*{(3)}

If dq=2d_q = 2 for some qubit, then F(x,y)=0F(x,y) = 0 and −log⁡F(x,y)=+∞-\log F(x,y) = +\infty.

(d) Complexity. For a circuit U(x)U(x) with entangling gates, F(x,y)=∣⟨0∣U(x)†U(y)∣0⟩∣2F(x,y) = |\langle0|U(x)^\dagger U(y)|0\rangle|^2 is a transition amplitude of U(x)†U(y)U(x)^\dagger U(y), whose exact evaluation is #P-hard in general.[22, 23] Removing entanglement reduces this cost to O(L)O(L).

The data confirm (a) to (c). Every one of the 146,598 × 132 Bloch vectors of the developing cortex has unit norm to six decimals. Across 80,000 pairs of Siletti cells, every pair satisfied the lower bound of (c), and the feature distance and −log⁡F-\log F had a Spearman correlation of 0.9998 (Extended Data Figure 5). The proof is given in Supplementary Note 7.

Extended Data Figure 5. The clusters are formed in quantum-state space. a, Bloch vectors of one qubit for 2,000 developing-cortex cells (400 per type): every vector has unit length, and the types occupy different arcs. b, For 80,000 Siletti cell pairs (gray, random; blue, 15-nearest neighbors), the log-infidelity −log⁡F-\log F against the feature distance 14∥f(x)−f(y)∥2\frac{1}{4}\lVert f(x)-f(y)\rVert^2; every pair lies above the lower bound of Theorem 4 (dashed). c, AMI at the annotated number of types on the developing cortex (blue) and the Siletti atlas (orange) for graphs built from scanpy’s principal components and the whitened scores (gray) and from the exact 132-qubit fidelity, the Bloch vectors and all quantum features (bars, search for three Leiden seeds; dots, see Extended Data Table 2). All quantum feature scores are 0.766 and 0.935, against 0.818 and 0.815 for the whitened scores.

Theory: saturation of single-direction differences.

Let two cells have scores x,y∈RLx,y \in\mathbb{R}^{L} and write ηq=xq−yq\eta_q = x_q-y_q. In score space their distance is ∥x−y∥2=∑qηq2\lVert x-y\rVert^2 = \sum_q \eta_q^2, which one direction can dominate. The encoding replaces each term by the chord between two points of the Bloch sphere.

Intuitively, the encoding turns every direction into a bounded, saturating term. A large difference along a single direction, such as a technical axis of sequencing depth or mitochondrial fraction, can move two cells apart by at most one qubit’s worth of distance, however large it is. Many small differences spread over many directions, the signature of a different cell type, add up almost linearly and are kept. Within-type spread is compressed and between-type separation is preserved, which is why abundant types stay whole and continuous lineages stay connected. Biologically: the oligodendrocytes of the Siletti atlas, which other methods split by mitochondrial read fraction, stay in one cluster, and cells along a differentiation path, such as OPCs maturing into oligodendrocytes, stay connected rather than being cut at an arbitrary point.

Proposition 1 (Saturation of single-direction differences). For the encoding of Theorem 2, with dq=∥rq(x)−rq(y)∥d_q = \lVert r_q(x) - r_q(y) \rVert and Λ=s(T+∑tβt)\Lambda= s\left(T + \sum_t \beta_t\right):

(a) Bounded contribution of every direction. dq≤2d_q \le2 for every qubit qq, so ∥f(x)−f(y)∥2=∑qdq2≤4L\lVert f(x) - f(y) \rVert^2 = \sum_q d_q^2 \le4L, whereas ∑qηq2\sum_q \eta_q^2 is unbounded.

(b) Linear for small and saturating for large differences. dq≤min⁡{Λ∣ηq∣,2}d_q \le\min\{\Lambda\lvert\eta_q\rvert, 2\}. For a single layer of RYR_Y rotations the chord is exact, dq=2∣sin⁡(sηq/2)∣d_q = 2\lvert\sin(s\eta_q/2)\rvert, so that dq≥(2s/π)∣ηq∣d_q \ge(2s/\pi)\lvert\eta_q\rvert whenever s∣ηq∣≤πs\lvert\eta_q\rvert\le\pi: the map is linear up to the constant 2s/π2s/\pi on differences below π/s\pi/s and saturates beyond.

(c) Many small differences outweigh one large difference. If xx and yy differ only along one direction, by any amount η0\eta_0, then ∥f(x)−f(y)∥≤2\lVert f(x) - f(y) \rVert\le2. If they differ by η≤π/s\eta\le\pi/s along each of MM directions, then for the single-layer map ∥f(x)−f(y)∥≥(2s/π)ηM\lVert f(x) - f(y) \rVert\ge(2s/\pi)\eta\sqrt{M}. The ratio of the second distance to the first is therefore at least sηM/πs\eta\sqrt{M}/\pi, which grows with MM, whereas in score space the same ratio is M/∣η0∣\sqrt{M}/\lvert\eta_0\rvert, which vanishes as ∣η0∣\lvert\eta_0\rvert grows.

(d) Fidelity form. For the single-layer map, F(x,y)=∏qcos⁡2(sηq/2)F(x,y) = \prod_q \cos^2(s\eta_q/2) and −log⁡F(x,y)=∑q−log⁡cos⁡2(sηq/2)≥∑q(sηq)2/4-\log F(x,y) = \sum_q -\log\cos^2(s\eta_q/2) \ge\sum_q(s\eta_q)^2/4: the state distance is a sum over directions of terms that are quadratic for small differences, so neighbors along a continuous lineage keep a fidelity near one and cells that differ on many qubits have a fidelity near zero.

Proof. (a) Bloch vectors have unit norm (Theorem 4a), so the chord between two of them is at most 2. (b) The upper bound is the Lipschitz bound of Theorem 2(b) applied to the Bloch map. For one RYR_Y layer, rq(x)=(sin⁡sxq,0,cos⁡sxq)r_q(x) = (\sin sx_q, 0, \cos sx_q), so dq=2∣sin⁡(sηq/2)∣d_q = 2\lvert\sin(s\eta_q/2)\rvert, and sin⁡(u/2)≥u/π\sin(u/2) \ge u/\pi for 0≤u≤π0 \le u \le\pi. (c) The first statement is (a) for one qubit; the second sums the lower bound of (b) over the MM differing qubits. (d) For one RYR_Y layer, ∣⟨χ(xq)∣χ(yq)⟩∣2=cos⁡2(sηq/2)\lvert\langle\chi(x_q)\mid\chi(y_q)\rangle\rvert^2 = \cos^2(s\eta_q/2), the product follows from Theorem 4(b), and −log⁡cos⁡2(u/2)≥u2/4-\log\cos^2(u/2) \ge u^2/4 for ∣u∣≤π\lvert u\rvert\le\pi. □

The upper bounds hold as stated for the three-layer circuit of KQE-2. The exact chord and the lower bounds are written for one RYR_Y layer, and for the three-layer circuit they hold with point-dependent constants. The measured separations agree: on the Siletti atlas, the encoding raised the separation of every major glial type, for example oligodendrocytes from 0.24 to 0.40, and KQE-2 kept 99.6% of the oligodendrocytes in one cluster (Results).

Embedding geometry metrics

Given an embedding EE with rows EiE_i and an annotated type cc with ncn_c cells, centroid μc\mu_c and within-type scatter tc=nc−1∑i∈c∥Ei−μc∥2t_c = n_c^{-1}\sum_{i\in c}\lVert E_i-\mu_c\rVert^2, the separation of cc is min⁡c′≠c∥μc−μc′∥/tc\min_{c'\ne c}\lVert\mu_c-\mu_{c'}\rVert/\sqrt{t_c}, and its neighborhood purity is the mean fraction of the 15 nearest neighbors of its cells that share its annotation. Both are computed identically on the unencoded whitened scores and on the quantum features of the same 150,000 cells; labels are used only for these measurements.

Exact quantum-state neighbors of a complete atlas

For each nucleus, the Bloch vectors rqr_q of its 132 qubits are computed in closed form from its whitened scores (T=3T=3, s=0.19s=0.19). Candidate neighbors are the M=200M=200 nuclei nearest in Euclidean distance between the Bloch-vector features ff, found on the GPU by matrix products. Their exact state distance −log⁡F=−∑qlog⁡((1+rq⋅rq′)/2)-\log F = -\sum_q \log((1+r_q\cdot r'_q)/2) is computed, and the 15 smallest are kept. By Theorem 4(c), every nucleus outside the candidate list has −log⁡F≥14∥f−f′∥2≥14eM-\log F \ge\frac{1}{4}\lVert f-f'\rVert^2 \ge\frac{1}{4}e_M, where eMe_M is the MMth smallest squared feature distance. When 14eM\frac{1}{4}e_M is at least the 15th smallest exact distance among the candidates, the 15 neighbors are therefore exact; for the nuclei without this certificate, all distances are computed exhaustively. The map of Supplementary Extended Data Figure 2 is a UMAP of the resulting 15-nearest-neighbor graph (random seed 0), colored by the KQE-2 partition of Table 1. Fidelities of random pairs use 200,000 pairs drawn from a stratified sample of 30,909 nuclei (at most 2,500 per cluster). The same procedure was applied to all 11,441,407 nuclei of the complete mouse embryo atlas; the colors of Figure 1c and Supplementary Extended Data Figure 2 merge the 26 major cell clusters of the authors into eight lineages.

Computational complexity

With nn cells, pp genes, nnz nonzero counts, L=132L=132 directions and K=15K=15 neighbors, every step of KQE-2 except the exact neighbor search is linear in nn (Supplementary Table 15). IDF weighting and normalization cost O(nnz)O(\mathrm{nnz}) and keep the matrix sparse. The decomposition uses only sparse matrix–vector products, O(nnz L+(n+p)L2)O(\mathrm{nnz}\,L + (n+p)L^2) per Lanczos restart, so no dense n×pn\times p matrix is formed. Without entanglement, each qubit is evaluated in closed form, so the encoding costs O(nL)O(nL) instead of the 2L2^L-dimensional state vector of an entangled block (Theorem 2), and the fidelity of two cells costs O(L)O(L) (Theorem 4). The exact neighbor search is quadratic, O(n2⋅3L)O(n^2\cdot3L) multiply-adds for the candidates on the GPU and O(nML)O(nML) for the exact fidelities of the M=200M=200 candidates; the lower bound of Theorem 4 certifies the neighbors without an exhaustive search for 99.99% of the Siletti nuclei. Leiden and the merge scale with the nKnK edges and with k3k^3, k′=round⁡(1.5k)k'=\operatorname{round}(1.5k). Memory is O(nnz+n⋅726)O(\mathrm{nnz}+n\cdot726), 33 GB of features for 11.4 million nuclei. On that atlas, the decomposition took 11.9 h, the certified neighbor search 3.1 h and Q-PSC 12 min. The compared methods are limited by training (scVI, scGPT and the dedicated methods), by dense intermediate matrices (scanpy and Seurat scale an n×2,000n\times2{,}000 matrix; scAGCL builds an n×nn\times n matrix) or by a hard limit of 2312^{31} nonzero entries (Seurat).

MethodStepTimeMemoryAt scale
KQE-2IDF weighting, normalizationO(nnz)O(\mathrm{nnz})sparse11.9 h
exact decomposition (ARPACK)O(nnz L+(n+p)L2)O(\mathrm{nnz}\,L+(n+p)L^2) per restartO(nnz+nL)O(\mathrm{nnz}+nL)
entanglement-free encodingO(nL)O(nL)O(n⋅726)O(n\cdot726)minutes
certified nearest statesO(n2⋅3L)+O(nML)O(n^2\cdot3L)+O(nML) on the GPUO(nK)O(nK)3.1 h
Leiden and merge (Q-PSC)O(nK)O(nK) per Leiden run +O(k3)+O(k^3)O(nK)O(nK)12 min
scanpyHVGs, scaling, PCAO(nnz)+O(n⋅2,000⋅50)O(\mathrm{nnz})+O(n\cdot2{,}000\cdot50)dense n×2,000n\times2{,}000no embedding returned
Seuratas scanpy, in Ras scanpydense n×2,000n\times2{,}000count matrix above 2312^{31} nonzero entries not read
scVIvariational autoencoder trainingO(n⋅2,000⋅h)O(n\cdot2{,}000\cdot h) per epochdata in memoryexceeded memory; one training epoch by default at ten million cells
scGPTtransformer inferenceO(n⋅g2d)O(n\cdot g^2d) per layerpretrained on human data only
scAGCLgraph contrastive learningdense n×nn\times n146,598 cells not run
scDAC, scDCCA, scICEtraining or repeated clusteringbeyond 3 h or 150 GB at 146,598 cells or fewer

Supplementary Table 15. Computational complexity of KQE-2 and of the compared methods. nn, cells; pp, genes; nnz, nonzero counts; L=132L=132 directions; K=15K=15 neighbors; M=200M=200 candidates; gg, gene tokens per cell (up to 1,200 for scGPT); dd, model width; hh, hidden width of scVI. Times, complete mouse embryo atlas (11,441,407 nuclei) on one server (40 CPU cores, 502 GB memory, one NVIDIA RTX 6000 Ada GPU); limits of the other methods from Table 1, Extended Data Supplementary Table 5 and Methods.

Rare embryonic types

On the mouse embryo atlas, the F1 of each annotated type is that of the cluster holding most of its nuclei (Leiden seed 0, annotated kk; KQE-2 with Q-PSC). For the marker check on the complete atlas, 3,000 nuclei of that KQE-2 cluster and 3,000 nuclei outside it were drawn at random (seed 0); case counts were normalized to 10410^4 per nucleus and log-transformed, the share of nuclei with a nonzero count of each canonical marker was compared inside and outside, and the top 10 markers of the cluster were ranked by the Wilcoxon test of scanpy.

Classical feature maps

To isolate the contribution of the quantum map, we benchmarked it against five families of transformations applied to the same whitened scores and clustered with the same protocol: block-wise random Fourier features cos⁡(s xW+b)\cos(s\,xW+b) with the output width of the quantum block; deterministic cosines and sines at the frequencies of the TT-layer circuit; a quadratic map per block; the bounded maps tanh⁡(x/a)\tanh(x/a) with a∈{1,2,3}a\in\{1,2,3\} and max⁡(−c,min⁡(c,x))\max(-c,\min(c,x)) with c∈{1.5,2.5}c\in\{1.5,2.5\}; and the circuit with controlled-ZZ chains. For the rare-population titration, the OPCs of the complete Siletti atlas and the microglia of the complete RADC atlas were subsampled to 2% and 0.5% of the cells (seed 1) with every other cell kept; each representation was clustered at the annotated kk with three Leiden seeds, and recovery was measured by the F1 of the type against its best-matching cluster.

Reproducibility and perturbation experiments

Run-to-run perturbations are the differences between the scores of two randomized decompositions with seeds 0 and 1, after aligning the sign of each direction; Gaussian perturbations of standard deviation ε∈{0.05,0.1,0.2}\varepsilon\in\{0.05,0.1,0.2\} are added to the scores of 2,000 cells, 30 draws each. Local variance (Theorem 3) is tested on 1,000 cells with the statevector of one six-qubit block, perturbing the other five scores (γ=0.2\gamma=0.2, 20 draws) or inserting a Pauli-X error on qubit 2 before the last layer. State-space graphs use −log⁡F-\log F or the Euclidean distance between Bloch vectors as the distance of the 15-nearest-neighbor graph. For the training-seed test, scVI was trained with seeds 0, 1 and 2 on the complete Siletti, zebrafish, fetal, developing cortex and RADC atlases with the benchmark settings; a second run with seed 0 gave an identical embedding. scGPT embeddings of the complete Siletti atlas were computed three times with the benchmark settings (whole-human checkpoint, which samples at most 1,200 genes per cell). To measure how a training seed changes the biology on the fetal atlas, each annotated type was matched to the scVI cluster holding most of its cells under each seed; markers were the top-50 Wilcoxon markers of that cluster against all other cells (log-normalized counts of the whole transcriptome, up to 3,000 cells per group, log fold change above 1 and Benjamini–Hochberg adjusted P<0.01P < 0.01), pathways were taken from Enrichr (GO Biological Process 2023 and KEGG 2021) and established drug targets were defined as in the drug-target analysis below. Each embedding was clustered at the annotated kk with Leiden seed 0, and the share of cells that changed cluster between two runs is one minus the size of the largest one-to-one matching between the two partitions, as a fraction of all cells.

Pathway, interactome and drug-target analyses. On each 150,000-cell subsample, markers were called on the log-normalized counts of the whole transcriptome for every type with at least 20 cells (up to 3,000 cells per type) with the Wilcoxon test of scanpy against all other cells, keeping the top 50 per type with log fold change above 1 and Benjamini–Hochberg adjusted P<0.01P < 0.01. Pathway enrichment used Enrichr[58] (Gene Ontology (GO) Biological Process 2023, KEGG 2021 Human and Reactome 2022), protein interaction density used STRING v12[59] (Homo sapiens interaction enrichment test), and drug targets were queried through the GraphQL interface of DGIdb 5.0,[60] all on 15 October 2026. An established drug target is a gene with at least one interaction with an approved drug that states a mode of action (for example inhibitor, antagonist, agonist or blocker) from ChEMBL, Guide to Pharmacology, TTD, TEND, DrugBank or the FDA. Disease genes have a definitive, strong or moderate gene–disease validity classification in ClinGen,[61] downloaded on 15 October 2026. Approval by the FDA was checked for every drug in Drugs@FDA (openFDA interface, 8 November 2026), matching drug names with their salt forms. For the 52,888 cardiomyocytes of the 141,017-cell benchmark sample of the heart atlas, the top-50 Wilcoxon markers were called on the whole transcriptome against the 2,000 HVGs of the scapy (flavor ‘seurat’); the network of the 50 genes and the interaction enrichment of the removed genes used STRING v12.5 (combined score at least 0.4), and their pathways used Enrichr, both on 8 November 2026. The share of retained variance carried by gene ii is ∑jσi2Vij2/∑iσi2\sum_j \sigma_i^2 V_{ij}^2 / \sum_i \sigma_i^2, where σi\sigma_i are the 132 retained singular values and VV are the gene loadings of the IDF-weighted matrix.

Baseline embedding and clustering methods. All competing methods were run with their standard published pipelines. scanpy:[4] normalization to 10410^4 counts, log1p, 2,000 HVGs, unit-variance scaling clipped at 10, 50 principal components. Seurat 5.3.0:[5] NormalizeData, FindVariableFeatures (2,000 genes), ScaleData, 50 principal components. scVI 1.4.2:[6] raw counts of 2,000 HVGs, 30 latent dimensions, default training. scGPT:[7] the pretrained whole-human checkpoint applied to raw counts. Dedicated clustering methods were run from their official repositories on the same 150,000-cell subsamples (seed 0) under a 3-hour wall-clock limit and a 150-GB memory watchdog: scICE[8] (scLENS preprocessing on the GPU, UMAP, consistency clustering over 1 to max(20, kk + 5) clusters), scDCCA[9] (2,000 HVGs, size-factor normalization, latent dimension 32, encoder layers 256 and 64, 70 pretraining and 100 training epochs), scAGC[10] (its own graph preprocessing, 500 epochs, kk-means) and scDAC[11] (raw counts of 4,000 Seurat-v3 HVGs, 500 epochs).

Maps. The maps of Figs. 1b, 2b, 3 and 4a–d were drawn with SR-tSNE2, a fast implementation of the rank-preserving method SR-tSNE.[64] It computes a t-SNE embedding[62] with openTSNE[63] (perplexity 30, PCA initialization, seed 42, 250 early-exaggeration and 750 further iterations) and then refines it, pulling each point toward its 90 nearest neighbors in the input space (weight λ=50\lambda= 50, 10 neighbors per step). Each map is built from the embedding of the method it shows; Fig. 4a–d colors one map from the KQE-2 features by the clusters of each run. The maps of Fig. 1c,d are the UMAP of the certified 15-nearest-state graph of the complete mouse embryo atlas (see below). In Fig. 3, each embedding was clustered by Leiden at the annotated kk (seed 0) on its 15-nearest-neighbor graph, the protocol of Table 1. A cell is misassigned when its cluster is not the one paired with its annotated type in the one-to-one pairing of clusters and types that matches the most cells (Hungarian algorithm on the contingency table).

Unified graph construction and Leiden scoring. Every embedding was evaluated through the same downstream protocol. An exact 15-nearest-neighbor graph was built on the GPU, weighted with the fuzzy simplicial set of UMAP[65] and partitioned with Leiden.[66] To score at the annotated number of types kk, the resolution was found by bisection from 0.02 (at most 12 steps) until the partition had kk clusters, for Leiden seeds 0, 1 and 2. Table 1, Fig. 3 and Extended Data Tables 3 and 4 report seed 0; the other tables report the mean over the three seeds. Labels are used only to set kk and to score.

Q-PSC: quantum precision shrinkage clustering on the quantum-state graph. On whole-transcriptome atlases, KQE-2 clusters on the graph of its quantum states (Supplementary Fig. 1). The 15 neighbors of each cell are its certified exact nearest states under −log⁡F-\log F (previous paragraphs; Theorem 4), and the edge between cells ii and jj is weighted by their fidelity Fij=∏q12(1+riq⋅rjq)F_{ij} = \prod_q \frac{1}{2}(1 + r_{iq} \cdot r_{jq}); the weight matrix is symmetrized by the larger of the two directions. Leiden (seed 0) is bisected to k′=round⁡(1.5k)k' = \operatorname{round}(1.5k) clusters (Python rounding, which sends halves to the even integer). With Π\Pi the n×k′n \times k' membership matrix and AA the fidelity-weighted adjacency matrix, C=ΠTAΠC = \Pi^\mathsf{T} A\Pi holds the summed fidelity between clusters; the pair (a,b)(a,b) that maximizes Cab/vavbC_{ab}/\sqrt{v_a v_b}, with va=∑b′Cab′v_a = \sum_b' C_{ab'}, is merged, CC and vv are updated, and the step is repeated until kk clusters remain. Every step is deterministic and needs no parameter beyond the factor 1.5. Given the scores, the certified neighbors and the clusters were bit-for-bit identical on rerun and on a second server with another software environment (mouse cerebellum). On the complete mouse embryo atlas, the bisection toward k′=201k' = 201 reached 202 clusters, and that partition was merged to k=134k = 134.

Quantum hardware. Circuits were executed through the IBM Quantum Open plan on the 156-qubit superconducting processor ibm_marrakesh (Heron r2) with Qiskit 2.5.2 and qiskit-ibm-runtime 0.50.0 (EstimatorV2, 1,024 shots, readout-error mitigation at resilience level 1). Qubits with readout error above 0.15 were excluded, and disjoint 6-qubit paths were found on the coupling graph. Jobs db82lm6il99s73fp68ag (50 cells) and db82u8m6oqs73881mlg (380 cells), 15 October 2026 (Supplementary Note 5).

Statistics. AMI[12] and the adjusted Rand index[67] were computed with scikit-learn; values follow the seed convention of the scoring protocol above, with the range of the seeds given where it is reported. Agreement between hardware and exact features is measured by the Pearson correlation and distance preservation by the Spearman correlation. Because every method was evaluated on the same cells, graph construction and Leiden protocol, comparisons between methods are paired. The AMI of KQE-2 in the configuration of Table 1 was compared with that of the best other method and of each method on the atlases where it ran, by the one-sided Wilcoxon signed-rank test over atlases (SciPy), with a bootstrap 95% confidence interval of the mean margin (10,000 resamples of the atlases, seed 0). Rare types are annotated types below 1% of the cells, and the F1 of a type is that of the cluster holding most of its cells (Leiden seed 0, annotated kk). The F1 of KQE-2 and of each other method were compared over the rare types by the one-sided Wilcoxon signed-rank test stratified by atlas (van Elteren), which ranks the differences within each atlas and weights each atlas by 1/(na+1)1/(n_a + 1) for its nan_a rare types, so that no atlas dominates the test.

Data availability

All atlases are public on CZ CELLxGENE Discover;[3] the dataset versions are listed in Supplementary Table 14. The cytokine-stimulated PBMC dataset is distributed by Parse Biosciences under a CC BY-NC 4.0 license.[49]

AtlasDataset version id
Zebrafish developmente3ae71af-1cd6-451b-8735-3d06e12d7360
Fetal (sci-RNA-seq)f6271b1a-71f7-4c4e-a109-c9949ac42bc1
Optic nerveb27057d6-a6a0-40e8-a4ba-5373a03746d2
Siletti non-neuronalbef677f9-90fa-4cc4-a0f8-6892c6f646bb
Heart (DCM and ACM)6d0b8b8a-2b22-4578-b8ee-8ca4ab893594
Developing cortex2001fbc7-de84-4e84-9a76-4290bcd65415
RADC brain54293783-669c-410e-919d-474960f8761b
Tabula Sapiens (All Cells)1c88f927-bcbb-4bb1-9881-281842945a2d
Mouse cortex and hippocampus0e7c9ff7-a65f-4909-b864-3a89c5421f55
Mouse embryo (subset 1)aaf0497e-a8a9-4a81-8b22-c1ac86507c6b
Mouse embryo (complete)1bc30289-9565-4099-abf9-3326328c11ac
Mouse cerebellum64c8b6a7-ac09-4ceb-8ad3-eaf512ea2ac2

Supplementary Table 14. Dataset versions. All files from CZ CELLxGENE Discover, https://datasets.cellxgene.cziscience.com/<id>.h5ad.

Code availability

The Python package scKQE2 (imported as sckqe2; version 2.1.0) implements every step of KQE-2, including the gene-set rule, Q-PSC on the certified quantum-state graph, quantum alignment, the certified exact search of nearest quantum states and the circuits run on quantum hardware. It comes with a tutorial, a Google Colab notebook, tests against a brute-force statevector simulation and scripts that download the atlases and reproduce the results, and is available at https://github.com/hank08819/scKQE-2.

Acknowledgements

The concept of kernel quantum encoding (KQE) and its initial quantum machine learning results originated in September 2021. KQE-2 repre- sents the culmination of more than five years of sustained exploration, evolving through successive iterations of the quantum encoding, whole- transcriptome modeling and mathematical theory across ever-larger single-cell atlases, and ultimately arriving at the exact, entanglement- free framework presented here. We thank Dr. Erica Baker for insightful discussions on quantum computing in fall 2021. Above all, we pay tribute to the memory of Professor Zhang Han (1938–2024), whose unwavering encouragement and lifelong guidance made this journey possible.

Funding

This work was supported by the start-up funds of the McCollum Family Chair in Data Sciences, Baylor University.

Author contributions

H.H. conceived the study, developed the method, proved the theorems, performed the experiments and wrote the manuscript.

Competing interests

The author declares no competing interests.

Extended Data

Extended Data Figure 1. The single-qubit map is a bounded function of the whitened score. ⟨X⟩\langle X\rangle, ⟨Y⟩\langle Y\rangle and ⟨Z⟩\langle Z\rangle of one qubit after three layers RY(βtsx)R_Y(\beta_t s x), RZ(sx)R_Z(s x), βt=1,1/2,1/4\beta_t = 1, 1/2, 1/4, against the whitened score xx; a, s=0.25s = 0.25; b, s=0.19s = 0.19. On the developing cortex (mean of three Leiden seeds), all quantum features reach an AMI of 0.740, the single-qubit features 0.651, ⟨Z⟩\langle Z\rangle alone 0.677 and the whitened scores 0.192.

Extended Data Table 1 | KQE-2 runs on every organism, assay and scale of this study and gives the same result on every run. Every entry refers to an observation of this study (Results; Extended Data Supplementary Table 5; Supplementary Table 12). Dedicated methods: scICE, scDCCA, scAGCL and scDAC.

KQE-2scGPTscVIscanpy, SeuratDedicated methods
Organismhuman, mouse, zebrafishhuman only (whole-human checkpoint)any, retrained per atlasanyany
Assay10x 3′ and 5′, sci-RNA-seq3, Smart-seq; cells and nucleiset by pretraininganyanyany
Scale0.61 to 11.4 million cells, one server29 to 39 min per atlas for the embeddingretrained on every atlas; one run on 2.86 million nucleiscanpy runs; Seurat cannot read matrices above 2312^{31} nonzeros146,598 cells not completed in 3 h and 150 GB
Geneswhole transcriptome1,200 sampled per cell2,000 HVGs; the whole transcriptome lowers the accuracy (0.908 to 0.771)2,000 HVGs2,000 to 4,000 HVGs
Trainingnonepretrained; four atlases predate the snapshotretrained for every atlasnonetrained on every dataset
Same result on rerunyes, bit for bitno (ARI 0.63 between embeddings)no (ARI 0.58 to 0.75 between seeds)yes with a fixed Leiden seed; HVG selection removes the same markers each timeno (random initialization)
Donor correctiondeterministic (quantum alignment)nonebatch covariate in trainingHarmony, seed-dependent (F1 0.98, 0.98, 0.64)none
Quantum hardwareruns, audited against exact valuesn.a.n.a.n.a.n.a.
Labels usednumber of clusters onlysamesamesamesame

Table 1 (PDF p. 19).

Extended Data Table 2 | Clustering in quantum-state space is more accurate than clustering the whitened scores. AMI at the annotated number of types, mean over three Leiden seeds (range in parentheses), on the 150,000-cell subsamples. Every graph uses 15 nearest neighbors and the same Leiden protocol; only the distance changes. State fidelity: −log⁡F-\log F between the 132-qubit states of Theorem 4. Bloch vectors: Euclidean distance between the single-qubit Bloch vectors, which equals 2\sqrt{2} times the Hilbert–Schmidt distance of the states. All features: Bloch vectors and within-block ⟨ZiZj⟩\langle Z_i Z_j\rangle, the encoding of Table 1. On the Siletti atlas, the exact fidelity graph reaches 0.925 against 0.815 for the whitened scores.

Graph built fromDeveloping cortex (k=5k = 5)Siletti (k=13k = 13)
scanpy principal components0.600 (0.598–0.601)0.810 (0.801–0.823)
Whitened scores0.188 (0.172–0.199)0.815 (0.773–0.869)
Quantum-state fidelity0.485 (0.181–0.638)0.925 (0.925–0.926)
Bloch vectors0.678 (0.637–0.758)0.932 (0.927–0.941)
All features of the encoding0.766 (0.766–0.766)0.935 (0.935–0.935)

Table 2.

Extended Data Table 3 | Paired tests show that the gains of KQE-2 are systematic. a, AMI margin of KQE-2 (Table 1) over the best other method and over each method, on the atlases where that method ran; one-sided Wilcoxon signed-rank test over atlases. b, Macro-averaged F1 of the rare types of each atlas; the F1 of a type is taken in the cluster holding most of its cells; n.a., no per-type result. The developing cortex has no rare type. Bottom rows, one-sided Wilcoxon signed-rank test over the rare types, stratified by atlas (van Elteren).

aAMI over atlases
Comparisonatlasesmean marginatlases higherPP
Best other method10+0.0508 (2 within range)0.0049
scanpy10+0.08790.0020
Seurat5+0.10450.031
scVI10+0.06590.0020
scGPT6+0.09960.016
bRare types
Atlasrare typesscanpySeuratscVIscGPTKQE-2
Zebrafish820.2810.2780.330n.a.0.387
Tabula Sapiens148n.a.n.a.0.2740.2780.282
Fetal530.2410.2760.3340.3550.476
Optic nerve400.5670.5650.5520.4940.558
Siletti non-neuronal80.6750.5610.6720.5630.658
Mouse embryo1190.316n.a.0.392n.a.0.486
Mouse cerebellum80.893n.a.0.897n.a.0.972
RADC brain110.549n.a.0.5510.5530.547
Mouse cortex110.550n.a.0.535n.a.0.600
Rare types compared332183480260
Mean F1 gain of KQE-2+0.127+0.110+0.054+0.039
PP1.1×10−261.1 \times10^{-26}1.1×10−141.1 \times10^{-14}2.1×10−82.1 \times10^{-8}0.043

Table 3.

MethodGenes20,000 cells50,000 cells146,598 cells
scICEwhole transcriptome (scLENS)71 min2.7 hbeyond 3 h
scDCCA2,000 HVGs13 min1.8 hbeyond 3 h
scAGCL2,000 HVGs51 min2.3 hdense n×nn \times n matrix
scDAC4,000 HVGs6.4 hbeyond 150 GBbeyond 150 GB
KQE-2whole transcriptome1.9 min4.3 min11 min

Table 5. KQE-2 clusters 146,598 cells in 11 minutes, beyond the reach of dedicated clustering methods. Wall-clock time of one run from raw counts to cluster labels. Limits: 3 hours and 150 GB of memory per run. Dedicated clustering methods ran on a shared server (NVIDIA RTX A6000, 40 CPU cores, 502 GB memory); KQE-2 on one NVIDIA RTX 6000 Ada GPU, whole transcriptome, deterministic decomposition, from raw counts to cluster labels at the annotated number of types. Genes: input used by each method.

Figure S1. Quantum precision shrinkage clustering (Q-PSC). Both pipelines start from the exact quantum states of KQE-2: 132 whitened scores, one qubit each, no entangling gate (Theorems 2 to 4). Top, for comparison, precision shrinkage clustering (PSC): the same steps on the feature graph, the 15 nearest neighbors by distance between the 726 features. Bottom, Q-PSC on the quantum-state graph, the certified exact 15 nearest states with edges weighted by the fidelity FijF_{ij}; KQE-2 uses it on whole-transcriptome atlases (Table 1). On either graph, Leiden (seed 0) divides the cells into round(1.5k1.5k) clusters, and the pair of clusters with the largest Cab/vavbC_{ab}/\sqrt{v_a v_b} is merged until kk clusters remain (Methods). Every step is deterministic.

Figure S2. A complete atlas in exact quantum-state space: each KQE-2 cluster is a region of nearby quantum states. Saletti non-neuronal brain atlas, 888,263 nuclei, 13 KQE-2 clusters (Table 1, AMI 0.963); every quantity is computed from the exact 132-qubit states. a, Bloch vectors of the three qubits that separate the clusters most (between-cluster variance), seen from the +Z pole; 250 nuclei per cluster. Each qubit traces a bounded path, and the clusters occupy different arcs of it. b, Map of all 888,263 nuclei, built from the exact 15-nearest-neighbor graph under the state distance −log⁡F-\log F; circles mark the three smallest clusters. c, Share of the 15 nearest states of the nuclei of each cluster that lie in each cluster: on average, 99.90% lie in the own cluster. d, State fidelity of nearest states (median 0.12) and of random pairs in the same cluster (0.0075) and in different clusters (0.00053). e, All 11,441,407 nuclei of the complete mouse embryo atlas, mapped from their exact 15-nearest-neighbor graph and colored by eight lineages merged from the atlas annotations. f, Same plot: notochord, Purkinje cells, endocardium, amniotic cells and amnion epithelium form islands of nearby quantum states; percentages, share of the 15 nearest states of their nuclei that belong to the same type.

Supplementary Note 1: the encoding under class imbalance. To test the encoding under class imbalance, we lowered the share of OPCs in the Siletti atlas from their native 11.9% (105,734 cells) to 2% and 0.5% (3,932 cells) while keeping every other cell. The encoding gave the highest AMI at every share (0.928, 0.916 and 0.911), ahead of the same whitened scores (0.915, 0.902 and 0.887), tanh (0.909 to 0.887), RFF (0.849 to 0.907) and scanpy (0.817 to 0.782). The margin of the encoding over its own whitened scores widened from 0.013 to 0.024 as the OPCs became rarer. The gain comes from the abundant types, which the encoding keeps from fragmenting, while the OPCs themselves stayed well recovered at 2% and 0.5% (F1F_1 0.95 and 0.83). On the complete RADC atlas, lowering the share of microglia from 4.4% to 2% and 0.5% gave 0.951, 0.946 and 0.944 for the encoding, against 0.938 to 0.940 for the whitened scores, 0.941 to 0.947 for RFF and 0.887 to 0.932 for scanpy.

Supplementary Note 2: a worked example of the state distances. Take two cells with two scores each, xA=(0.5,−1.2)x_A = (0.5, -1.2) and xB=(1.4,−1.0)x_B = (1.4, -1.0), and the encoding of the Methods with T=3T = 3 and s=0.19s = 0.19. Each score is turned into a single-qubit state (a,b)(a,b) by three layers of RYR_Y and RZR_Z rotations, and its Bloch vector is r=(2Re⁡(abˉ),2Im⁡(abˉ),∣a∣2−∣b∣2)\mathbf{r} = (2\operatorname{Re}(a\bar{b}), 2\operatorname{Im}(a\bar{b}), |a|^2 - |b|^2). Supplementary Table 1 lists every intermediate quantity. On qubit 1, d12=0.09675d_1^2 = 0.09675; the Hilbert–Schmidt distance of the two density matrices is 0.04838 = d12/2d_1^2/2, and the fidelity of the two single-qubit states, computed from the amplitudes, is 0.97581 = 1−d12/41 - d_1^2/4. On qubit 2 the same identities hold with d22=0.00521d_2^2 = 0.00521. The two-qubit fidelity is the product F=0.97454F = 0.97454, so −log⁡F=0.02579-\log F = 0.02579. The feature distance gives the lower bound 14∥Δf∥2=0.02549\frac{1}{4}\lVert\Delta f\rVert^2 = 0.02549, and the upper bound of Eq. (3) is 0.02609; the state distance lies between them, as Theorem 4 states.

QubitxA,xBx_A, x_BrA\mathbf{r}_ArB\mathbf{r}_Bdq2d_q^2HSFqF_q
10.5, 1.4(0.161, 0.038, 0.986)(0.350, 0.268, 0.898)0.096750.048380.97581
2−1.2, −1.0(−0.325, 0.203, 0.924)(−0.289, 0.145, 0.946)0.005210.002610.99870

Supplementary Table 1. In a worked example, the state distance lies between the two bounds of Theorem 4. Two cells, two qubits, T=3T = 3, s=0.19s = 0.19; 0.02549 ≤ −log⁡F-\log F = 0.02579 ≤ 0.02609. HS, squared Hilbert–Schmidt distance ∥ρA−ρB∥HS2\lVert\rho_A - \rho_B\rVert_{\mathrm{HS}}^2; FqF_q, single-qubit fidelity from the amplitudes.

F=0.97581×0.99870=0.97454F = 0.97581 \times0.99870 = 0.97454; 14∥Δf∥2=0.02549≤−log⁡F=0.02579≤0.02609\frac{1}{4}\lVert\Delta f\rVert^2 = 0.02549 \le-\log F = 0.02579 \le0.02609

Supplementary Note 3: atlases released before the pretraining of scGPT. The whole-human model of scGPT was pretrained on the normal cells of the CZ CELLxGENE Census, version of 8 May 2023, [7] Supplementary Table 2 gives, for each human atlas of this study, the date on which its collection was first released on CELLxGENE Discover (curation interface, accessed 17 October 2026). Four atlases were public before the pretraining snapshot, so scGPT may have seen their normal cells during pretraining, which can only raise its scores. The other three were released after the snapshot. KQE-2 is not pretrained and sees every atlas for the first time.

AtlasFirst releaseBefore snapshotCells that scGPT may have seen
Tabula Sapiens[2]19 Jul 2021yesall cells (healthy donors)
Fetal[42]3 Jun 2021yesnormal cells
Heart[42]5 Aug 2022yescells of control donors
Siletti non-neuronal[34]9 Dec 2022yesall cells (normal)
Developing cortex[35]19 Sep 2023nonone
Optic nerve[35]5 May 2025nonone
RADC[41]29 Jul 2025nonone

Supplementary Table 2. Four human atlases were public before the pretraining snapshot of scGPT (8 May 2023), and KQE-2 was more accurate than scGPT on the three of them benchmarked in Table 1. First release of the CELLxGENE collection; for the fetal and Siletti atlases the evaluated file is a subset whose cells are in the collection’s primary datasets.

Supplementary Note 4: markers and ablation of the oligodendrocyte split. Each KQE-2 cluster is marked by the canonical genes of its type (Extended Data Figure 3). The precursor clusters express PDGFRA, CSPG4 and OLIG2, the microglia clusters P2RY12, CX3CR1 and CSF1R, and the oligodendrocyte clusters MBP, PLP1 and MOBP. The small Siletti clusters of 837 to 1,332 cells carry GDF10 (Bergmann glia), TTR and KCNJ13 (choroid plexus), FOXN1 (ependymal cells), CLDN5 and FLT1 (endothelial cells) and PDGFRB and RGS5 (pericytes). The oligodendrocyte clusters into which the other methods divide this type differ in technical quality rather than in identity (Extended Data Figure 2). On the complete Siletti atlas, the second scGPT cluster has a median mitochondrial read fraction 7.6 times that of the largest one (0.497% against 0.065%). The oligodendrocyte clusters of Seurat and scGPT differ 3.1- and 4.4-fold in mitochondrial reads and 1.5- and 2.5-fold in counts per cell. KQE-2 keeps 99.6% of the oligodendrocytes of the displayed cells (82,746 of 83,112) in one cluster. Significance analysis can detect and merge such clusters after clustering. KQE-2 avoids the split at the embedding step. An ablation shows how (Extended Data Table 4). Deleting the 11 mitochondrial genes from scanpy’s 2,000 HVGs still leaves three oligodendrocyte clusters. KQE-2 keeps the full quality information in its scores (a ridge regression recovers log counts with R2=0.99R^2 = 0.99, against 0.56 for scanpy), and whitening keeps it from dominating the nearest-neighbor graph: unwhitened scores divide the oligodendrocytes into two clusters, and

Extended Data Table 4 | Whitening and the quantum encoding together keep the oligodendrocytes in one cluster. Siletti non-neuronal brain atlas, 150,000-cell subsample, 83,112 annotated oligodendrocytes. R2R^2: five-fold cross-validated ridge regression from the embedding to percentage of mitochondrial counts and to log⁡10\log_{10} counts per cell, within oligodendrocytes (20,000 cells). Clusters: Leiden at the annotated kk (seed 0), clusters holding at least 5% of the oligodendrocytes; MT, mitochondrial; MT ratio, median mitochondrial percentage of the second-largest over the largest. AMI over all 13 types (Leiden seed 0). KQE-2 keeps one oligodendrocyte cluster and reaches the highest AMI, 0.935.

EmbeddingR2R^2 (%MT)R2R^2 (counts)ClustersMT ratioAMI
scanpy (2,000 HVGs)0.680.5638.160.801
scanpy, no MT genes0.140.5531.420.838
Scores, IDF, unwhitened0.730.9920.230.797
Scores, IDF, whitened0.730.991–0.803
Scores, no IDF, whitened0.690.981–0.846
KQE-2 (IDF, whitened, encoding)0.740.981–0.935
Encoding, no IDF, whitened0.760.981–0.866

Table 4.

whitened scores keep them in one. Whitening alone merges the OPCs into the oligodendrocytes (AMI 0.803), and the quantum encoding separates them again while keeping one oligodendrocyte cluster (AMI 0.935).

The encoding widens the margin between types, as Proposition 1 predicts: on the Siletti atlas, the distance from each major glial type to its nearest other type, relative to its spread, rose from 0.24–0.33 to 0.40–0.46 (Methods).

Supplementary Note 5: details of the reproducibility analyses. Tests of the theorems. We tested each part on 150,000 cells of the developing cortex and the Siletti atlas. We compared two runs of a randomized decomposition with different seeds, over 19.4 and 19.8 million cell-qubit pairs. Every Bloch vector moved by at most 0.70 and 0.71 times the bound Λ∣ξ∣\Lambda|\xi| of Theorem 2. Under Gaussian perturbations of the scores, the largest variance of any feature is 0.57 to 0.75 of its bound. Without entanglement, perturbing the other five scores of a block or inserting an XX error on a neighboring qubit changes a qubit’s features by at most 1.3×10−151.3 \times10^{-15}. With controlled-ZZ chains, the same perturbation moves them with a standard deviation of 7×10−47 \times10^{-4} to 9×10−49 \times10^{-4}. The same error moves them by a mean of 0.23 to 0.27, as Theorem 3 states.

From features to clusters. We then asked whether the guarantee reaches the clusters (Corollary 1). The two decompositions give @page 22/28 starts_mid=0 ends_mid=1 Supplementary Note 1: the encoding under class imbalance. To test the encoding under class imbalance, we lowered the share of OPCs in the Siletti atlas from their native 11.9% (105,734 cells) to 2% and 0.5% (3,932 cells) while keeping every other cell. The encoding gave the highest AMI at every share (0.928, 0.916 and 0.911), ahead of the same whitened scores (0.915, 0.902 and 0.887), tanh (0.909 to 0.887), RFF (0.849 to 0.907) and scanpy (0.817 to 0.782). The margin of the encoding over its own whitened scores widened from 0.013 to 0.024 as the OPCs became rarer. The gain comes from the abundant types, which the encoding keeps from fragmenting, while the OPCs themselves stayed well recovered at 2% and 0.5% (F1F_1 0.95 and 0.83). On the complete RADC atlas, lowering the share of microglia from 4.4% to 2% and 0.5% gave 0.951, 0.946 and 0.944 for the encoding, against 0.938 to 0.940 for the whitened scores, 0.941 to 0.947 for RFF and 0.887 to 0.932 for scanpy.

Supplementary Note 2: a worked example of the state distances. Take two cells with two scores each, xA=(0.5,−1.2)x_A = (0.5, -1.2) and xB=(1.4,−1.0)x_B = (1.4, -1.0), and the encoding of the Methods with T=3T = 3 and s=0.19s = 0.19. Each score is turned into a single-qubit state (a,b)(a,b) by three layers of RYR_Y and RZR_Z rotations, and its Bloch vector is r=(2Re⁡(abˉ),2Im⁡(abˉ),∣a∣2−∣b∣2)\mathbf{r} = (2\operatorname{Re}(a\bar{b}), 2\operatorname{Im}(a\bar{b}), |a|^2 - |b|^2). Supplementary Table 1 lists every intermediate quantity. On qubit 1, d12=0.09675d_1^2 = 0.09675; the Hilbert–Schmidt distance of the two density matrices is 0.04838 = d12/2d_1^2/2, and the fidelity of the two single-qubit states, computed from the amplitudes, is 0.97581 = 1−d12/41 - d_1^2/4. On qubit 2 the same identities hold with d22=0.00521d_2^2 = 0.00521. The two-qubit fidelity is the product F=0.97454F = 0.97454, so −log⁡F=0.02579-\log F = 0.02579. The feature distance gives the lower bound 14∥Δf∥2=0.02549\frac{1}{4}\lVert\Delta f\rVert^2 = 0.02549, and the upper bound of Eq. (3) is 0.02609; the state distance lies between them, as Theorem 4 states.

QubitxA,xBx_A, x_BrA\mathbf{r}_ArB\mathbf{r}_Bdq2d_q^2HSFqF_q
10.5, 1.4(0.161, 0.038, 0.986)(0.350, 0.268, 0.898)0.096750.048380.97581
2−1.2, −1.0(−0.325, 0.203, 0.924)(−0.289, 0.145, 0.946)0.005210.002610.99870

Supplementary Table 1 (PDF p. 22). In a worked example, the state distance lies between the two bounds of Theorem 4. Two cells, two qubits, T=3T = 3, s=0.19s = 0.19; 0.02549 ≤ −log⁡F-\log F = 0.02579 ≤ 0.02609. HS, squared Hilbert–Schmidt distance ∥ρA−ρB∥HS2\lVert\rho_A - \rho_B\rVert_{\mathrm{HS}}^2; FqF_q, single-qubit fidelity from the amplitudes.

F=0.97581×0.99870=0.97454F = 0.97581 \times0.99870 = 0.97454; 14∥Δf∥2=0.02549≤−log⁡F=0.02579≤0.02609\frac{1}{4}\lVert\Delta f\rVert^2 = 0.02549 \le-\log F = 0.02579 \le0.02609

Supplementary Note 3: atlases released before the pretraining of scGPT. The whole-human model of scGPT was pretrained on the normal cells of the CZ CELLxGENE Census, version of 8 May 2023, [7] Supplementary Table 2 gives, for each human atlas of this study, the date on which its collection was first released on CELLxGENE Discover (curation interface, accessed 17 October 2026). Four atlases were public before the pretraining snapshot, so scGPT may have seen their normal cells during pretraining, which can only raise its scores. The other three were released after the snapshot. KQE-2 is not pretrained and sees every atlas for the first time.

AtlasFirst releaseBefore snapshotCells that scGPT may have seen
Tabula Sapiens[2]19 Jul 2021yesall cells (healthy donors)
Fetal[42]3 Jun 2021yesnormal cells
Heart[42]5 Aug 2022yescells of control donors
Siletti non-neuronal[34]9 Dec 2022yesall cells (normal)
Developing cortex[35]19 Sep 2023nonone
Optic nerve[35]5 May 2025nonone
RADC[41]29 Jul 2025nonone

Supplementary Table 2 (PDF p. 22). Four human atlases were public before the pretraining snapshot of scGPT (8 May 2023), and KQE-2 was more accurate than scGPT on the three of them benchmarked in Table 1. First release of the CELLxGENE collection; for the fetal and Siletti atlases the evaluated file is a subset whose cells are in the collection’s primary datasets.

Supplementary Note 4: markers and ablation of the oligodendrocyte split. Each KQE-2 cluster is marked by the canonical genes of its type (Extended Data Figure 3). The precursor clusters express PDGFRA, CSPG4 and OLIG2, the microglia clusters P2RY12, CX3CR1 and CSF1R, and the oligodendrocyte clusters MBP, PLP1 and MOBP. The small Siletti clusters of 837 to 1,332 cells carry GDF10 (Bergmann glia), TTR and KCNJ13 (choroid plexus), FOXN1 (ependymal cells), CLDN5 and FLT1 (endothelial cells) and PDGFRB and RGS5 (pericytes). The oligodendrocyte clusters into which the other methods divide this type differ in technical quality rather than in identity (Extended Data Figure 2). On the complete Siletti atlas, the second scGPT cluster has a median mitochondrial read fraction 7.6 times that of the largest one (0.497% against 0.065%). The oligodendrocyte clusters of Seurat and scGPT differ 3.1- and 4.4-fold in mitochondrial reads and 1.5- and 2.5-fold in counts per cell. KQE-2 keeps 99.6% of the oligodendrocytes of the displayed cells (82,746 of 83,112) in one cluster. Significance analysis can detect and merge such clusters after clustering. KQE-2 avoids the split at the embedding step. An ablation shows how (Extended Data Table 4). Deleting the 11 mitochondrial genes from scanpy’s 2,000 HVGs still leaves three oligodendrocyte clusters. KQE-2 keeps the full quality information in its scores (a ridge regression recovers log counts with R2=0.99R^2 = 0.99, against 0.56 for scanpy), and whitening keeps it from dominating the nearest-neighbor graph: unwhitened scores divide the oligodendrocytes into two clusters, and

whitened scores keep them in one. Whitening alone merges the OPCs into the oligodendrocytes (AMI 0.803), and the quantum encoding separates them again while keeping one oligodendrocyte cluster (AMI 0.935).

The encoding widens the margin between types, as Proposition 1 predicts: on the Siletti atlas, the distance from each major glial type to its nearest other type, relative to its spread, rose from 0.24–0.33 to 0.40–0.46 (Methods).

Supplementary Note 5: details of the reproducibility analyses. Tests of the theorems. We tested each part on 150,000 cells of the developing cortex and the Siletti atlas. We compared two runs of a randomized decomposition with different seeds, over 19.4 and 19.8 million cell-qubit pairs. Every Bloch vector moved by at most 0.70 and 0.71 times the bound Λ∣ξ∣\Lambda|\xi| of Theorem 2. Under Gaussian perturbations of the scores, the largest variance of any feature is 0.57 to 0.75 of its bound. Without entanglement, perturbing the other five scores of a block or inserting an XX error on a neighboring qubit changes a qubit’s features by at most 1.3×10−151.3 \times10^{-15}. With controlled-ZZ chains, the same perturbation moves them with a standard deviation of 7×10−47 \times10^{-4} to 9×10−49 \times10^{-4}. The same error moves them by a mean of 0.23 to 0.27, as Theorem 3 states.

From features to clusters. We then asked whether the guarantee reaches the clusters (Corollary 1). The two decompositions give scores that differ in the directions beyond the signal, yet the encoding gives nearly the same clusters in both runs. The adjusted Rand index between the runs is 0.90 and 0.99, against 0.43 and 0.81 for the scores themselves. Across 45 runs with three Leiden seeds each, the AMI of the encoding varied across seeds by a median of 0.005, against 0.011 for scanpy and 0.016 for the scores. The encoding was more stable than scanpy in 32 of the 45 runs. On the complete fetal atlas, three scVI runs scored an AMI of 0.716 to 0.720 (Leiden seed 0), and two runs agreed at an adjusted Rand index of 0.73 to 0.74.

Megakaryocytes and the allocation of clusters. For 10 of 68 types the two runs shared fewer than half of their top markers, and these were mostly rare types. Under seed 0 the megakaryocytes (832 cells, 0.09% of the atlas) fell into a cluster marked by hemoglobin genes (HBG2, HBA1), whose top pathway was gas transport. Under seed 2 they formed their own cluster (F1 0.86 against 0.11), marked by ITGA2B, PF4 and PLEK, with platelet aggregation and activation as top pathways. Under seed 0 the lymphatic endothelial cells (1,699 cells) merged with blood endothelium, marked by FLT1 and EMCN. Under seed 2 they formed their own cluster (F1 0.92 against 0.18), marked by PROX1, CCL21 and STAB2, with lymphatic endothelial differentiation as a top pathway. The megakaryocyte cluster of seed 2 carries ITGA2B, the target of the antiplatelet drugs abciximab, eptifibatide and tirofiban. It also carries PDE3A, the target of anagrelide; the cluster of seed 0 carries neither gene. KQE-2 gives its megakaryocytes their own cluster (F1 0.78). scanpy merges both the megakaryocytes and the lymphatic endothelial cells (F1 0.10 and 0.18). HVG selection removes 58% of the megakaryocyte markers, including PDE3A (150,000-cell subsample). In addition, at the annotated kk scanpy spends 28 of its 71 clusters on glutamatergic neurons, the largest type, against 13 for KQE-2. As a result, KQE-2 gives six more types a cluster of their own than scanpy. In scanpy, the megakaryocytes fall into a cluster of 13,901 myeloid and lymphoid cells, and the lymphatic endothelial cells into vascular endothelium.

Hardware. On IBM ibm_marrakesh we ran one 114-qubit circuit per cell for 380 developing-cortex cells (76 per type). The measured features reproduce the exact ones with correlation 0.978 (mean absolute error 0.050), and a 50-cell run on 132 qubits gives correlation 0.953. These runs include controlled-ZZ chains, a harder test than the entanglement-free encoding, which needs no two-qubit gate. Because the features of the encoding are exact on a classical computer, every hardware number can be checked against an exact reference, and atlas-scale results use the exact evaluation.

Across 42 comparisons, adding chains of controlled-ZZ entangling gates stayed within 0.01 AMI of the entanglement-free circuit in 31 cases and was ahead in 6.

Supplementary Note 6: which marker genes HVG selection removes.

The loss matters most when a whole type disappears into a neighboring cluster, because a type without a cluster has no markers to find. On the fetal atlas, scanpy places fewer than half of the cells of five types in one cluster, and KQE-2 on the whole transcriptome places more than half. These types are amacrine cells, retinal ganglion cells, inhibitory interneurons, lens fiber cells and neuroendocrine cells (5,327 cells). Their markers include 15 established drug targets, 12 of them outside the HVGs, among them GRIA4 (perampanel) and PDE4D (apremilast). In the developing cortex, HVG selection removes SCN1A, the Dravet syndrome gene, and the glutamate receptors GRIA2 and GRIK2 from the markers of OPCs.

Supplementary Note 7: proofs.

Proof of Theorem 1. (a) The shares uiu_i of Ψ\Psi form a probability vector with rank(Ψ\Psi) nonzero entries, and the Shannon entropy of such a vector is at most the logarithm of the number of its nonzero entries. Ψ\Psi has nn rows and 2l2^l columns, so rank(Ψ\Psi) ≤min⁡{n,2l}\le\min\{n,2^l\}. (b) The assumption gives ΨΨ†=XXT\Psi\Psi^\dagger= X X^T. The nonzero eigenvalues of both sides are the squared singular values, so σi(Ψ)=c σi(X)\sigma_i(\Psi)=\sqrt{c}\,\sigma_i(X) for every ii and rank(Ψ\Psi) = rr. A common factor cc cancels in uiu_i, hence ψ(Ψ)=h(X)\psi(\Psi) = h(X), and (a) gives h(X)≤log⁡2r≤lh(X) \le\log_2 r \le l. Equal row norms make c∥xi∥2=1c\|x_i\|^2 = 1 consistent with unit states. (c)

Tr⁡ρ2=1n2Tr⁡(Ψ†ΨΨ†Ψ)=1n2∥Ψ†Ψ∥F2=1n2∑i,j∣Gij∣2.\operatorname{Tr}\rho^2 = \frac{1}{n^2}\operatorname{Tr}(\Psi^\dagger\Psi\Psi^\dagger\Psi) = \frac{1}{n^2}\|\Psi^\dagger\Psi\|_F^2 = \frac{1}{n^2}\sum_{i,j}|G_{ij}|^2.

The eigenvalues λk≥0\lambda_k \ge0 of ρ\rho sum to one over at most 2l2^l indices, so by the Cauchy–Schwarz inequality ∑kλk2≥2−l\sum_k \lambda_k^2 \ge2^{-l}, with equality only when all 2l2^l eigenvalues equal 2−l2^{-l}.

Proof of Theorem 2. (a) The state is a tensor product, so the expectation of an operator acting on qubit qq depends only on V(xq)V(x_q), and the expectation of Zi⊗ZjZ_i \otimes Z_j factorizes. The entries of each rotation are cosines and sines of half its angle, so gPg_P is a trigonometric polynomial. (b) The circuit V(x)V(x) is a product of 2T2T gates e−iakxGk/2e^{-ia_k x G_k/2} with Pauli generators GkG_k and coefficients ak∈{s,β1s,…,βTs}a_k \in\{s,\beta_1s,\ldots,\beta_Ts\}. Differentiating gate by gate gives ∣gP′(x)∣≤∑k∣ak∣∥∥P∥∥=Λ|g_P'(x)| \le\sum_k |a_k|\|\|P\|\| = \Lambda, so gPg_P is Λ\Lambda-Lipschitz. For an independent copy ξ′\xi' of ξ\xi, E[ξ]=12E[(ξ−ξ′)2]≤12Λ2E[(ξ−ξ′)2]=Λ2Var⁡[ξ]\mathbb{E}[\xi] = \frac{1}{2}\mathbb{E}[(\xi-\xi')^2] \le\frac{1}{2}\Lambda^2\mathbb{E}[(\xi-\xi')^2] = \Lambda^2\operatorname{Var}[\xi]. The product gZ(xi)gZ(xj)g_Z(x_i)g_Z(x_j) has gradient norm at most 2Λ\sqrt{2}\Lambda because ∣gZ∣≤1|g_Z| \le1, and the same identity gives the second bound. (c) For any state ρ\rho and Pauli operator PP with ∥P∥=1\|P\| = 1, Tr⁡(P(ρ)−Tr⁡(Pρ)≤2ε\operatorname{Tr}(P(\rho) - \operatorname{Tr}(P\rho) \le2\varepsilon. Without entangling gates the noisy state remains a product ⨂qNq(ρq)\bigotimes_q \mathcal{N}_q(\rho_q), so ⟨Pq⟩\langle P_q\rangle sees only Nq\mathcal{N}_q, and ∣ab−a′b′∣≤∣a−a′∣+∣b−b′∣|ab-a'b'| \le|a-a'|+|b-b'| for ∣a∣,∣b′∣≤1|a|,|b'| \le1 gives the bound on ⟨ZiZj⟩\langle Z_iZ_j\rangle.

Proof of Theorem 3. (a) is Theorem 2: the state is a product, so fq,Pf_{q,P} is a function of xqx_q and of the channel acting on qubit qq alone. (b) Write Φ(O)=Γ†(O⊗I)Γ\Phi(O)=\Gamma^\dagger(O\otimes I)\Gamma for operators OO on qubit qq. Suppose Φ(O)=O′⊗I\Phi(O)=O'\otimes I for every OO. Then Φ\Phi is a unital ∗*-homomorphism from the 2×22 \times2 matrices into themselves, so by the Skolem–Noether theorem Φ(O)=V†OV\Phi(O)=V^\dagger O V for a unitary VV. The unitary Γ(V⊗I)\Gamma(V\otimes I) then commutes with every O⊗IO\otimes I, so it lies in the commutant I⊗M2I\otimes M_2 and equals I⊗Γ′I\otimes\Gamma', hence Γ=V⊗Γ′\Gamma=V\otimes\Gamma', a product. Therefore, if Γ\Gamma is not a product, some Pauli operator PP has Φ(P)=∑τστ⊗στ′\Phi(P)=\sum_\tau\sigma_\tau\otimes\sigma'_\tau with στ≠0\sigma_\tau\ne0 for some τ∈{X,Y,Z}\tau\in\{X,Y,Z\}. For product inputs ρq⊗ρq′\rho_q\otimes\rho_{q'}, Φ(P)=∑τTr⁡(ρqστ)Tr⁡(ρq′στ′)\Phi(P)=\sum_\tau\operatorname{Tr}(\rho_q\sigma_\tau)\operatorname{Tr}(\rho_{q'}\sigma'_\tau). Choose ρq\rho_q as an eigenvector of στ\sigma_\tau with nonzero eigenvalue, so that Tr⁡(Oτρq)≠0\operatorname{Tr}(O_\tau\rho_q)\ne0. Then ⟨Pq⟩\langle P_q\rangle varies with the Bloch component Tr⁡(ρq′στ′)\operatorname{Tr}(\rho_{q'}\sigma'_\tau) of qubit q′q', which varies when ρq′\rho_{q'} is set by xq′x_{q'}. A Pauli error on q′q' that anticommutes with τ\tau reverses the sign of that component, which violates (N). For the controlled-ZZ gate, CZ(X⊗I)CZ=X⊗Z\mathrm{CZ}(X\otimes I)\mathrm{CZ}=X\otimes Z gives ⟨Xq⟩=⟨X⟩q/⟨Z⟩q′\langle X_q\rangle= \langle X\rangle_q/\langle Z\rangle_{q'} explicitly. (c) Every feature is a trigonometric polynomial in xx, hence real analytic, so a dependence on xq′x_{q'} at one point holds on a set of nonzero measure. We evaluated the circuit exactly with 50 significant digits at x=(1.3,−0.7,2.1,0.4,−1.6,0.9)x=(1.3,-0.7,2.1,0.4,-1.6,0.9). Raising x1x_1 by changes ⟨X1⟩\langle X_1\rangle by 3.0×10−33.0 \times10^{-3} (s=0.19s=0.19) and 5.3×10−35.3 \times10^{-3} (s=0.25s=0.25) with controlled-ZZ chains, and by less than 10−5010^{-50} without them. A Pauli-XX error on qubit 2 before the last controlled-ZZ layer changes ⟨X1⟩\langle X_1\rangle by −0.598-0.598 and −0.594-0.594 with the chains, and by less than 10−5010^{-50} without them. □

Proof of Corollary 1. (a) Each gate e−iakxGk/2e^{-ia_kxG_k/2} rotates the Bloch vector of its qubit by the angle akxa_kx about a fixed axis, so ∥drq/dx∥≤∑k∣ak∣=Λ\|d r_q/dx\| \le\sum_k |a_k| = \Lambda, and rqr_q is Λ\Lambda-Lipschitz in its own score. Without entanglement, fif_i is the concatenation of the rq(xiq)r_q(x_{iq}), which gives (a). (b) follows from (a) and the triangle inequality. (c) By (b), every distance from cell ii changes by at most 2Λmax⁡j∥ξj∥≤δi/22\Lambda\max_j\|\xi_j\| \le\delta_i/2, so no neighbor outside the first KK can overtake anyone inside, and the neighbor set of ii is unchanged. (d) With ξi=0\xi_i = 0, every feature, single- or two-qubit, is the same function of the same scores, so the distances, the neighbor sets and the edge weights, fuzzy or fidelity, are identical; Leiden with a fixed seed and a KK-nearest-neighbor classifier are deterministic functions of the weighted graph. □

Proof of Theorem 4. (a) A pure single-qubit state is determined by its Bloch vector, which has unit length, and a product state is the tensor product of its factors. (b) ⟨ψ(x)∣ψ(y)⟩=∏q⟨χ(xq)∣χ(yq)⟩\langle\psi(x)|\psi(y)\rangle= \prod_q \langle\chi(x_q)|\chi(y_q)\rangle, and for two single-qubit pure states ∣⟨χ∣χ′⟩∣2=Tr⁡(ρρ′)=12(1+r⋅r′)|\langle\chi|\chi'\rangle|^2 = \operatorname{Tr}(\rho\rho') = \frac{1}{2}(1+\mathbf{r}\cdot\mathbf{r}'). For unit vectors r⋅r′=1−12∥r−r′∥2\mathbf{r}\cdot\mathbf{r}' = 1-\frac{1}{2}\|\mathbf{r}-\mathbf{r}'\|^2, which gives 1−dq2/41-d_q^2/4. (c) ρq(x)−ρq(y)=12(rq(x)−rq(y))⋅τ\rho_q(x)-\rho_q(y)=\frac{1}{2}(\mathbf{r}_q(x)-\mathbf{r}_q(y))\cdot\tau and Tr⁡(τaτb)=2δab\operatorname{Tr}(\tau_a\tau_b)=2\delta_{ab} give the Hilbert–Schmidt identity. If dq=2d_q=2 for some qq, the factor 1−dq2/41-d_q^2/4 vanishes and F=0F=0. Otherwise, with uq=dq2/4∈[0,1)u_q=d_q^2/4\in[0,1), −log⁡F=∑qlog⁡(1−uq)-\log F=\sum_q\log(1-u_q), and u≤−log⁡(1−u)≤u/(1−u)u\le-\log(1-u)\le u/(1-u) gives (3), since ∑quq=14∥f(x)−f(y)∥2\sum_q u_q=\frac{1}{4}\|f(x)-f(y)\|^2. (d) The overlap ⟨0∣U(x)†U(y)∣0⟩\langle0|U(x)^\dagger U(y)|0\rangle is the amplitude of the all-zero outcome of the circuit U(x)†U(y)U(x)^\dagger U(y). □

Supplementary Note 8: subtypes within annotated types. We asked whether KQE-2 separates cells that the annotation of an atlas groups together. On the fetal atlas (978,128 cells, 71 annotated types), we took every annotated type that is the majority of at least two KQE-2 clusters (Table 1 partition, Q-PSC, Leiden seed 0) of at least 300 cells. For each such cluster we recorded its purity (share of cells of its majority type); its stability, the largest Jaccard index with a cluster of the KQE-2 partition obtained by Leiden at kk on the feature graph, a partition reached by a different clustering step; the finer annotations of the authors inside the cluster, namely their 657 numbered subclusters (sub_cluster_name), obtained by re-clustering each type, and the name of the matched mouse cell type (Matched_MCA_cell_name);

AtlascellsscanpySeuratscVIscGPTKQE-2KQE-2 + Q-PSCMargin
Zebrafish1,120,3360.6200.6710.655 (0.654)n.a.0.7060.711+0.039
Tabula Sapiens1,136,1800.645n.r.10.658 (0.655)0.708 (0.705)0.7250.750+0.042
Fetal978,1280.6860.7160.717 (0.716)0.733 (0.729)0.7500.821+0.088
Optic nerve959,6290.7530.7490.769 (0.757)0.721 (0.713)0.7860.810+0.041
Siletti non-neuronal888,2630.8070.8320.908 (0.847)0.810 (0.777)0.9250.963+0.055
Developing cortex693,5440.5570.5460.528 (0.515)0.561 (0.524)0.730n.u.+0.169
Mouse embryo2,860,4650.7032n.r.30.7174n.a.0.7170.761+0.044
Mouse cerebellum611,0340.945n.r.30.926 (0.851)n.a.0.9180.977+0.032
RADC brain693,6770.886n.r.30.950 (0.945)0.891 (0.857)0.946n.u.−0.004 (w.r.)
Mouse cortex1,169,2130.846n.r.30.833 (0.825)n.a.0.844n.u.−0.002 (w.r.)

Table 1. KQE-2 is the most accurate method on eight of ten complete atlases and within the range of the best method’s runs on the other two. AMI at the annotated number of types (Leiden seed 0); every other method and the column KQE-2 use the same graph construction and scoring. scVI and scGPT, mean of three runs (lowest in parentheses). KQE-2, Leiden at kk on the 15-nearest-neighbor graph of its quantum features, the same downstream protocol as every other method; KQE-2 + Q-PSC, clustering on the certified quantum-state graph (Methods). The gene-set rule fixes the configuration of KQE-2: Q-PSC on whole-transcriptome atlases, and Leiden at kk on 5,000 HVGs for the developing cortex, RADC and mouse cortex atlases. Margin, this configuration minus the best other method; w.r., within the range of the best method’s seeds or runs (not a formal equivalence test). The developing cortex is scored at eight clusters. Bold, best per row. n.r., not run: a^{a}the count matrix exceeds the 2312^{31} nonzero entries that Seurat reads; b^{b}Seurat was run on the first six atlases. c^{c}At most 95 clusters within the resolution range. d^{d}One training run, at most 112 clusters. n.a., not applicable (the scGPT checkpoint is for human data); n.u., not used, because the gene-set rule selects 5,000 HVGs.

and its markers. Markers were found by the Wilcoxon test (scanpy) between up to 3,000 cells of the cluster and up to 3,000 other cells of the same annotated type (random seed 0), on library-size normalized log counts of the whole transcriptome, keeping genes with a log fold change above 1 and an adjusted PP below 10−1010^{-10}, ranked by the difference in the share of expressing cells. Supplementary Table 3 lists the clusters with stability of at least 0.7 whose markers identify a cell type. KQE-2 recovered five author subclusters at the atlas level, without labels and without re-clustering any type (Jaccard index 0.79 to 0.94). The authors left these subclusters numbered; the matched mouse names identify the MGE-derived interneurons (GABAergic neuron Lhx6 high), the ventricular cardiomyocytes (left ventricle cardiomyocyte) and the OPCs, but not the striatal projection neurons, the striosomal neurons, the CGE-derived interneurons or the OTX2-positive neurons, whose identities follow here from canonical markers.

Comparison with other methods. On the same fetal cells, we clustered the embeddings of scanpy, Seurat and scVI with their standard protocol of Table 1, Leiden at kk (seed 0); scGPT exceeded the GPU memory in this run. For each KQE-2 cluster of Supplementary Table 3 we report the largest Jaccard index with any cluster of each partition (Supplementary Table 4). No other partition reached 0.7

for the striatal projection neurons (at most 0.55), the CGE-derived interneurons (at most 0.64) or the 529 striosomal neurons (at most 0.03). The MGE-derived interneurons, the OTX2-positive neurons, the ventricular cardiomyocytes and the OPCs were also resolved by at least one other method.

Independent replication in the mouse embryo. We repeated the search on the complete mouse embryo atlas (11,441,407 nuclei; KQE-2 with Q-PSC, 134 clusters), and compared each cluster with both the cell ontology label and the 190 finer cell-type labels of the authors (author_cell_type);5 a cluster is unnamed when both labels are shared with the rest of its type. Markers were computed on up to 3,000 nuclei per side as above. Of 78 clusters that split an annotated type, 32 had a stability of at least 0.7 and a purity of at least 0.8. Several followed developmental time rather than identity (for example, hepatocytes divided by embryonic day) and are not listed. Supplementary Table 5 lists the clusters whose markers identify a cell type and that no author label matches. The five neuronal clusters are labeled GABAergic cortical interneurons for 95% to 100% of their nuclei even at the finest author level, whose only interneuron labels are this one and cortical interneurons (Prox1+); none of the 190 labels names striatal neurons. The two mesodermal clusters are labeled lateral plate and intermediate mesoderm for 92% and 98% of their nuclei. Because no other method clustered the complete atlas, these clusters have no counterpart in another partition.

On the complete mouse embryo atlas, KQE-2 separated striatal projection neurons (Ebf1Ebf1, RarbRarb, Foxp2Foxp2) from an indirect-pathway cluster (Drd2Drd2 in 49% of nuclei against 2%, Adora2aAdora2a 14% against 0%) and from interneurons of medial (Lhx6Lhx6, Nxph1Nxph1) and caudal (Adarb2Adarb2) ganglionic eminence origin.

On the complete mouse embryo atlas, the endocardium cluster expresses Npr3Npr3 and Nfatc1Nfatc1 (59% and 45% of the nuclei, against 4% and 4%), and the amacrine cluster expresses Tfap2bTfap2b (63% against 5%).

Striatal projection neurons control movement and reward; they degenerate in Huntington’s disease and lose their dopamine input in Parkinson’s disease.

Supplementary Note 9: quantum k-means. Quantum k-means estimates the distance between each cell state and each centroid state on a quantum processor and assigns every cell to the nearest centroid.[68] In the limit of exact distances, it returns the partition of classical k-means on the same features. We therefore ran k-means (k-means++ initialization, Lloyd iterations, scikit-learn) on the 726 quantum features of KQE-2 at the annotated kk, with random seeds 0, 1 and 2. On the Siletti atlas, k-means reached an AMI of 0.646 to 0.652 and a macro-averaged rare-type F1 of 0.231 to 0.241, against 0.963 and 0.658 for KQE-2; its largest cluster held 19% to 22% of the nuclei, so the oligodendrocytes, 55% of the atlas, were divided, and its partitions agreed between seeds at ARIs of 0.61 to 0.81. On the fetal atlas, k-means reached 0.652 to 0.660 (rare-type F1 0.227 to 0.289), against 0.821 (0.476) for KQE-2, with ARIs of 0.68 to 0.78 between seeds. We also ran quantum k-means with PennyLane 0.45 (default.qubit) on 1,040 Siletti nuclei (up to 80 per type), each represented by its first 6-qubit block, with the distance estimated by the swap test on 13 qubits. One swap test with 1,000 shots took 23 ms, against about 0.003 ms for the closed-form fidelity of the same pair, and its estimate of the fidelity varied with a standard deviation of 0.012 between shot draws. With 1,000 shots, one clustering of the 1,040 nuclei (13 centroids, 10 iterations, 135,200 swap tests) took 1.5 to 1.6 h, against 0.3 to 0.6 s with exact fidelities; three runs that differed only in the shot seed agreed at ARIs of 0.79 to 0.90 with the exact partition and 0.81 between one another, and 100 shots lowered the agreement to 0.69. One clustering of the Siletti atlas with 10 iterations would need 1.2×1081.2 \times10^{8} swap tests, 31 days for a single 6-qubit block, and the swap test of the complete 132-qubit states needs 265 qubits, beyond any simulator.

Supplementary Note 10: Secuer. Secuer[69] selects anchor cells by random sampling and k-means, links every cell to its nearest anchors, clusters the resulting bipartite graph spectrally and assigns the clusters by k-means; its authors report clustering of a simulated dataset of 10 million cells. We ran it as in its paper, on the 50 principal components of 2,000 HVGs (the scanpy embedding of Table 1), with default parameters (1,000 anchors, 5 nearest anchors) and the annotated kk, for random seeds 1, 2 and 3 (Supplementary Table 6). Its AMI was 0.06 to 0.24 below that of KQE-2 on every atlas, with the largest gaps on the imbalanced atlases (developing cortex 0.24, mouse cerebellum 0.23, Siletti 0.21), and its partitions changed with the seed: on the mouse cerebellum, the AMI ranged from 0.61 to 0.95 and two seeds agreed at an ARI of 0.21. Secuer needs a principal component embedding, which scanpy did not return for the complete 11.4-million-nucleus embryo atlas.

AtlasSecuer AMISecuer rare F1ARI between seedstime (s)KQE-2 AMI
Siletti non-neuronal0.736–0.7980.39–0.670.78–0.8612–130.963
Mouse cerebellum0.610–0.9540.35–0.730.21–0.35100.977
Optic nerve0.686–0.7000.36–0.410.57–0.6221–230.810
Fetal0.629–0.6320.19–0.210.51–0.5530–340.821
Zebrafish0.559–0.5800.21–0.230.43–0.4946–520.711
Mouse cortex0.766–0.7990.13–0.270.71–0.7918–190.844
Mouse embryo (2.86 million)0.628–0.6310.23–0.250.46–0.47189–2170.761
Developing cortex (kk = 8)0.481–0.499n.a.0.53–0.78100.730

Supplementary Table 6. Supplementary Table 6 | Secuer on the complete atlases. AMI at the annotated kk for random seeds 1, 2 and 3 (range), macro-averaged F1 of rare types (range), pairwise ARI between the three seeds (range) and clustering time per run; KQE-2 as in Table 1. The developing cortex has no rare type.

Secuer clustered the scanpy embeddings of eight atlases in 10 to 217 s; across seeds, its partitions agreed at ARIs of 0.21 to 0.86.

Supplementary Note 11: stability under resampling and sequencing depth. After the cell filter of Table 1, we drew three subsamples of 80% of the cells without replacement (random seeds 0, 1 and 2) and halved every count by binomial thinning (pp = 0.5 per count, seed 0). Each was processed from raw counts by KQE-2 in the configuration of Table 1 (whole transcriptome, IDF, exact decomposition, Q-PSC) and by the standard scanpy pipeline (2,000 HVGs, scaling, 50 principal components, Leiden at kk on the Table 1 graph, seed 0), with the scKQE2 package. Agreement between two partitions is the ARI on the cells they share. Supplementary Table 7 gives the results; the complete-atlas Siletti run of this test is not listed. To isolate the quantum encoding, we clustered the scores of every run also without it, with the same graph protocol, Leiden seed and merge rule: Leiden at kk on the 15-nearest-neighbor graph of the scores against Leiden at kk on the certified quantum-state graph, and the scores with the merge against Q-PSC. Supplementary Table 8 lists every paired comparison. The 14 stability comparisons and the 20 accuracy comparisons come from two atlases and share subsamples within an atlas, so they are not fully independent.

AtlasMeasureKQE-2scanpy
FetalAMI, complete atlas0.8210.690
AMI, three 80% subsamples0.819, 0.819, 0.8240.687, 0.682, 0.685
ARI between subsamples0.94, 0.97, 0.940.68, 0.70, 0.67
ARI of each subsample with the complete atlas0.95, 0.98, 0.940.77, 0.68, 0.71
AMI, half the reads0.7840.587
ARI, half the reads with full depth0.900.45
Siletti non-neuronalAMI, three 80% subsamples0.965, 0.964, 0.9640.858, 0.811, 0.843
ARI between subsamples0.999, 0.999, 0.9990.59, 0.91, 0.57
AMI, half the reads0.9720.849

Supplementary Table 7. Supplementary Table 7 | Stability of KQE-2 and scanpy under cell resampling and halved sequencing depth. AMI at the annotated kk; ARI between partitions on shared cells. scanpy, the standard pipeline run through the scKQE2 package; row counts, so its complete-atlas AMI (0.690) differs slightly from the benchmark embedding of Table 1 (0.686).

Atlas, clusteringComparisonwithout encodingwith encodingdifference
Fetal, LeidenARI, subsamples 0–1, 0–2, 1–20.806, 0.823, 0.8280.836, 0.853, 0.838+0.029, +0.030, +0.010
ARI, half depth0.6780.696+0.018
Fetal, mergeARI, subsamples0.943, 0.952, 0.9210.940, 0.967, 0.940−0.003, +0.015, +0.019
ARI, half depth0.8690.897+0.028
Siletti, LeidenARI, subsamples0.946, 0.946, 0.9980.999, 0.999, 0.999+0.054, +0.053, +0.000
Siletti, mergeARI, subsamples0.996, 0.999, 0.9960.999, 0.999, 0.999+0.003, +0.000, +0.003
Stability, all 14 comparisons13 highermean +0.018
Fetal, LeidenAMI, 3 subsamples, half depth, complete0.752, 0.743, 0.748, 0.712, 0.7500.747, 0.743, 0.747, 0.716, 0.743mean −0.002
Fetal, mergeAMI0.815, 0.813, 0.816, 0.772, 0.8140.819, 0.819, 0.824, 0.784, 0.821mean +0.007
Siletti, LeidenAMI0.914, 0.939, 0.938, 0.937, 0.9390.956, 0.956, 0.955, 0.966, 0.956mean +0.024
Siletti, mergeAMI0.966, 0.956, 0.966, 0.972, 0.9650.965, 0.964, 0.964, 0.972, 0.963mean +0.001
Accuracy, all 20 runs14 highermean +0.008

Supplementary Table 8. Supplementary Table 8 | The quantum encoding makes the partitions more stable. Same scores with and without the encoding. ARI between the partitions of two 80% subsamples (shared cells), or between half and full depth; AMI of each run. Leiden: Leiden at kk on the score graph or on the certified quantum-state graph; merge: the scores with the merge, or Q-PSC.

The quantum encoding contributes to this stability: on the same scores, clustering without the encoding gave less stable partitions in 13 of 14 paired comparisons (ARI gain of the encoding up to 0.030 on the fetal atlas and up to 0.054 on the Siletti atlas), and a lower AMI in 14 of 20 runs (mean gain 0.008; 0.024 on the Siletti atlas with Leiden at kk).

Supplementary Note 12: the merging step on the graphs of the other methods. To measure the contribution of the merging step, we adapted it to the embeddings of the other methods. On the graph of Table 1 for each embedding (exact 15 nearest neighbors, UMAP fuzzy weights), Leiden (seed 0) was bisected to round(1.5k1.5k) clusters and the pair of clusters with the largest normalized connectivity

Cabvavb\frac{C_{ab}}{\sqrt{v_a v_b}}

was merged until kk clusters remained, the merge rule of Q-PSC (Supplementary Table 9). The quantum-state graph and its certificate are specific to KQE-2 and were not used for the other methods. The merging step raised the AMI of the other methods on most atlases. KQE-2 in the configuration of Table 1 remained the most accurate on the fetal (0.821 against 0.780), zebrafish (0.711 against 0.675), mouse embryo (0.761 against 0.738) and developing cortex (0.730 against 0.703) atlases, and was within 0.01 of the highest value on the Tabula Sapiens, RADC and mouse cortex atlases. On the Siletti, optic nerve and mouse cerebellum atlases, the adapted merge on the other embeddings gave the highest values (0.983, 0.869 and 0.998). The merging step is thus a general contribution of the framework, and KQE-2 combines it with a whole-transcriptome input, exact quantum-state geometry and bit-for-bit reproducibility.

AtlasscanpySeuratscVIscGPTKQE-2KQE-2 + Q-PSC
Zebrafish0.609 → 0.6410.656 → 0.6750.645 → 0.664–0.7060.711
Tabula Sapiens——0.650 → 0.6730.706 → 0.7520.7250.750
Fetal0.690 → 0.7320.710 → 0.7570.711 → 0.7700.728 → 0.7800.7500.821
Optic nerve0.753 → 0.8610.751 → 0.8690.784 → 0.8640.724 → 0.8000.7860.810
Siletti non-neuronal0.810 → 0.9820.838 → 0.9830.939 → 0.9820.836 → 0.9610.9250.963
Developing cortex0.545 → 0.6660.554 → 0.6140.526 → 0.5880.617 → 0.7030.730n.u.
Mouse embryo0.686 → 0.698—0.703 → 0.738—0.7170.761
Mouse cerebellum0.945 → 0.998—0.963 → 0.998—0.9180.977
RADC brain0.912 → 0.939—0.955 → 0.9490.901 → 0.9400.946n.u.
Mouse cortex0.844 → 0.767—0.807 → 0.776—0.844n.u.

Supplementary Table 9. Supplementary Table 9 | The merging step adapted to the graphs of the other methods. AMI at the annotated kk, Leiden at kk → Leiden to round(1.5k1.5k) clusters and merge to kk, from the same run (first training run of scVI and scGPT; Table 1 gives the mean of three runs). Here the resolution is bisected up to 6.0 in at most 30 steps, so that every partition has exactly kk clusters; Table 1 bisects up to 3.0 in at most 12 steps (methods), so the Leiden values can differ. KQE-2, Leiden at kk on its feature graph; KQE-2 + Q-PSC, as in Table 1 (n.u., the gene-set rule selects 5,000 HVGs and KQE-2 uses Leiden at kk), not run (Table 1).

On the three atlases for which the gene-set rule selects 5,000 HVGs, KQE-2 applies Leiden at kk directly. This choice matches the data: on these atlases, Q-PSC lowered the AMI on the RADC (0.946 to 0.800) and mouse cortex (0.844 to 0.773) atlases and changed it little on the developing cortex (0.730 to 0.742; Supplementary Table 10). A possible explanation is that 5,000 HVGs give less complete quantum states, so that the merge joins neighboring types more often.

Supplementary Note 13: choosing the resolution without labels. When kk is unknown, the Leiden resolution is not comparable across methods: at the same resolution, the graph of KQE-2 gives more clusters than the graphs of the other methods (at resolution 0.05, 10 against 7 to 8 on the Siletti atlas and 21 against 14 to 16 on the optic nerve), so comparisons without a given kk should match the number of clusters rather than the resolution. The rule below was written down, with a time stamp and a file checksum, before any of its runs. For each method and atlas we built one graph: for KQE-2, its graph of Table 1 without the merge (the certified quantum-state graph on whole-transcriptome atlases, the 15-nearest-neighbor graph of the quantum features on 5,000-HVG atlases), and also the feature graph on every atlas; for the other methods, the graph of Table 1. Leiden was run at the resolutions 0.02, 0.05, 0.1, 0.2, 0.3, 0.5, 0.75, 1, 1.5, 2 and 3 with seeds 0, 1 and 2. The stability S(r)S(r) of a resolution is the mean ARI over the three pairs of seeds. The chosen resolution is the largest one with S(r)≥max⁡S−0.02S(r) \ge\max S - 0.02 among those that give at least two clusters, that is, the finest partition about as stable as the most stable one. The input and the graph of each method are those of Table 1. For KQE-2 they follow the gene-set rule, which uses the annotated number of types kk through Δ=hsig−log⁡2k\Delta= h_{\mathrm{sig}} - \log_{2} k, so kk enters the input configuration of KQE-2. Only the subsequent choice of resolution uses neither the labels nor kk; the annotation was then used to score the chosen partition (seed 0). The test therefore shows that, given the input configuration of Table 1, the resolution can be chosen without labels. As a check of the configuration, Leiden at the annotated kk on the KQE-2 feature graph reproduced the KQE-2 column of Table 1 on eight atlases exactly and within 0.003 on the other two. Supplementary Table 11 gives the results. KQE-2 chose finer partitions than the other methods on most atlases; they recovered rare types better on seven of the nine atlases that have them, and the coarser partitions of the other methods reached a higher AMI on most atlases.

AtlasKQE-2 AMIKQE-2 feature graph AMIbest other AMIKQE-2 rare F1best other rare F1
Zebrafish0.636 (21)0.766 (22)0.506 (Seurat, 7)0.1860.040
Tabula Sapiens0.734 (98)0.736 (57)0.757 (scGPT, 31)0.2120.116
Fetal0.815 (30)0.810 (46)0.817 (Seurat, 22)0.2110.188
Optic nerve0.823 (18)0.876 (12)0.929 (scGPT, 19)0.2560.422
Siletti non-neuronal0.910 (17)0.880 (18)0.970 (Seurat, 8)0.7690.672
Developing cortex0.440 (18)same0.571 (Seurat, 8)––
Mouse embryo0.611 (11)0.744 (19)0.736 (scanpy, 17)0.0740.109
Mouse cerebellum0.895 (22)0.971 (13)0.993 (scVI, 14)0.9720.825
RADC brain0.944 (27)same0.955 (scVI, 21)0.6890.555
Mouse cortex0.828 (23)same0.839 (scVI, 21)0.4490.436

Supplementary Table 11. Supplementary Table 11 | Resolution chosen without labels, on the input configuration of Table 1. AMI at the chosen resolution (number of clusters) and macro F1 of rare types (< 1% of the cells). KQE-2, the graph fixed before the runs; feature graph, KQE-2 on the 15-nearest-neighbor graph of its quantum features (the same graph as the KQE-2 column on 5,000-HVG atlases). Best other method by AMI; best rare-type F1 over the other methods. –, no rare type.

DatasetOrganismTissueTechnologyCellsGeneskkLargestEvennessDonors
Zebrafish[31]zebrafishembryo, 11 stagessci-RNA-seq31,220,17832,03110012%0.711,400
Fetal[32]human15 fetal organssci-RNA-seq31,001,28845,6767132%0.6428
Optic nerve[33]humanoptic nerve and disc10x 3′ v3959,62935,4775229%0.5883
Siletti[34]human88 brain regions10x 3′ v3888,26358,2321355%0.544
Heart[42]humanventricles; cardiomyopathy10x 3′ v2, v3881,08132,383938%0.7479
Dev. cortex[35]human10 cortical regions10x 3′ v2, v3709,37217,631577%0.51106
RADC[41]humanprefrontal cortex; AD10x 3′ v3693,68234,1762434%0.72152
Tabula Sapiens[2, 48]human28 tissues; cells10x 3′ v3, 5′ v2, Smart-seq1,136,21861,49717110%0.7324
Mouse cortex[38]mouseisocortex, hippocampus; cells10x 3′ v21,169,21330,1772729%0.7355
Mouse embryo[36]mousewhole embryo, 16 stagessci-RNA-seq32,860,46545,52513413%0.6874
Mouse embryo, completemousewhole embryo, 16 stagessci-RNA-seq311,441,40745,52513413%0.6874
Mouse cerebellum[37]mousecerebellum10x 3′ v3611,03423,6931678%0.376
PBMC, 90 cytokines[49]humanblood; stimulated PBMCs; cellssplit-pool barcoding9,697,97440,3521825%0.7812

Supplementary Table 13. Supplementary Table 13 | Datasets. Cells and genes as distributed; kk, annotated types with at least 10 cells; largest, share of the most abundant type; evenness, entropy of the type shares divided by log⁡2k\log_{2} k; donors, distinct donors (zebrafish: embryos). All atlases are single-nucleus profiles of normal tissue unless stated (cells, single-cell suspensions); Mouse embryo, complete: all four subsets of the mouse embryo atlas, used for the scale test. AD, Alzheimer disease; Dev., developing.

References

  1. [1]Regev, A. et al. The Human Cell Atlas. eLife 6, e27041 (2017).
  2. [2]The Tabula Sapiens Consortium. The Tabula Sapiens: a multiple-organ, single-cell transcriptomic atlas of humans. Science 376, eabf4896 (2022).DOI
  3. [3]CZI Cell Science Program et al. CZ CELLxGENE Discover: a single-cell data platform for scalable exploration, analysis and modeling of aggregated data. Nucleic Acids Research 53, D886–D900 (2025).DOI
  4. [4]Wolf, F. A., Angerer, P. & Theis, F. J. SCANPY: large-scale single-cell gene expression data analysis. Genome Biology 19, 15 (2018).DOI
  5. [5]Hao, Y. et al. Dictionary learning for integrative, multimodal and scalable single-cell analysis. Nature Biotechnology 42, 293–304 (2024).DOI
  6. [6]Lopez, R., Regier, J., Cole, M. B., Jordan, M. I. & Yosef, N. Deep generative modeling for single-cell transcriptomics. Nature Methods 15, 1053–1058 (2018).DOI
  7. [7]Cui, H. et al. scGPT: toward building a foundation model for single-cell multi-omics using generative AI. Nature Methods 21, 1470–1480 (2024).DOI
  8. [8]Kim, H. et al. scICE: enhancing clustering reliability and efficiency of scRNA-seq data with multi-cluster label consistency evaluation. Nature Communications 16, 6031 (2025).DOI
  9. [9]Wang, J., Xia, J., Wang, H., Su, Y. & Zheng, C.-H. scDCCA: deep contrastive clustering for single-cell RNA-seq data based on auto-encoder network. Briefings in Bioinformatics 24, bbac625 (2023).DOI
  10. [10]Van Vinh, L., Nhat Quang, T., Hoang Hiep, L., Nhat Phuong, P. & Van Hoai, T. Deep clustering of single-cell RNA-seq using adversarial graph contrastive learning. Briefings in Bioinformatics 26, bbaf423 (2025).
  11. [11]An, S. et al. scDAC: deep adaptive clustering of single-cell transcriptomic data with coupled autoencoder and Dirichlet process mixture model. Bioinformatics 40, btae198 (2024).DOI
  12. [12]Vinh, N. X., Epps, J. & Bailey, J. Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. Journal of Machine Learning Research 11, 2837–2854 (2010).
  13. [13]Zhao, R. et al. A systematic evaluation of highly variable gene selection methods for single-cell RNA-sequencing. Genome Biology 26, 424 (2025).DOI
  14. [14]Wang, A. et al. Label-free selection of marker genes in single-cell and spatial transcriptomics with geneCover. Genome Research 35, 2744–2755 (2025).DOI
  15. [15]Dollinger, E. P. et al. Statistically principled feature selection for single cell transcriptomics. BMC Bioinformatics 26, 238 (2025).
  16. [16]Vershynin, R. How close is the sample covariance matrix to the actual covariance matrix? Journal of Theoretical Probability 25, 655–686 (2012).arxiv.org/abs/1004.3484
  17. [17]Grabski, I. N., Street, K. & Irizarry, R. A. Significance analysis for clustering with single-cell RNA-sequencing data. Nature Methods 20, 1196–1202 (2023).DOI
  18. [18]Schuld, M. & Killoran, N. Quantum machine learning in feature Hilbert spaces. arXiv 1803.07128 (2018).DOI
  19. [19]Pérez-Salinas, A., Cervera-Lierta, A., Gil-Fuster, E. & Latorre, J. I. Data re-uploading for a universal quantum classifier. Quantum 4, 226 (2020).
  20. [20]Havlíček, V. et al. Supervised learning with quantum-enhanced feature spaces. Nature 567, 209–212 (2019).DOI
  21. [21]Bose, A. et al. Advancing single-cell omics and cell-based therapeutics with quantum computing. Nature Reviews Molecular Cell Biology 27, 394–408 (2026).DOI
  22. [22]Valiant, L. G. The complexity of computing the permanent. Theoretical Computer Science 8, 189–201 (1979).DOI
  23. [23]Aaronson, S. & Arkhipov, A. The computational complexity of linear optics. Theory of Computing 9, 143–252 (2013).
  24. [24]Schuld, M. & Killoran, N. Is quantum advantage the right goal for quantum machine learning? PRX Quantum 3, 030101 (2022).DOI
  25. [25]Bowles, J., Ahmed, S. & Schuld, M. Better than classical? The subtle art of benchmarking quantum machine learning models. arXiv 2403.07059 (2024).arxiv.org/abs/2403.07059
  26. [26]Kubacki, M. & Niranjan, M. Quantum annealing-based clustering of single cell RNA-seq data. Briefings in Bioinformatics 24, bbad377 (2023).DOI
  27. [27]Wang, F.-a. et al. Quantum-boosted high-fidelity deep learning. Preprint at https://arxiv.org/abs/2508.11190 (2025).
  28. [28]Qiu, P. Embracing the dropouts in single-cell RNA-seq analysis. Nature Communications 11, 1169 (2020).DOI
  29. [29]Nwizu, C. et al. Scalable nonparametric clustering with unified marker gene selection for single-cell RNA-seq data. Cell Reports Methods 6, 101329 (2026).DOI
  30. [30]Han, H., Forrest, J. Y.-L., Wang, J., Yuan, S., Han, F. & Li, D. Explainable machine learning for high frequency trading dynamics discovery. Information Sciences 684, 121286 (2024).
  31. [31]Duran, M. et al. A statistical framework for inferring genetic requirements from embryo-scale single-cell sequencing experiments. Preprint at bioRxiv https://doi.org/10.1101/2025.04.03.646654 (2025).
  32. [32]Cao, J. et al. A human cell atlas of fetal gene expression. Science 370, eaba7721 (2020).DOI
  33. [33]Single cell atlas of the human optic nerve. CZ CELLxGENE Discover https://cellxgene.cziscience.com/collections/05e3d0fc-c9dd-4f14-9163-2b242b3bb5c2 (2025).DOI
  34. [34]Siletti, K. et al. Transcriptomic diversity of cell types across the adult human brain. Science 382, eadd7046 (2023).DOI
  35. [35]Velmeshev, D. et al. Single-cell analysis of prenatal and postnatal human cortical development. Science 382, eadf0834 (2023).DOI
  36. [36]Qiu, C. et al. A single-cell time-lapse of mouse prenatal development from gastrula to birth. Nature 626, 1084–1093 (2024).DOI
  37. [37]Kozareva, V. et al. A transcriptomic atlas of mouse cerebellar cortex comprehensively defines cell types. Nature 598, 214–219 (2021).DOI
  38. [38]Yao, Z. et al. A taxonomy of transcriptomic cell types across the isocortex and hippocampal formation. Cell 184, 3222–3241 (2021).DOI
  39. [39]Wigle, J. T. & Oliver, G. Prox1 function is required for the development of the murine lymphatic system. Cell 98, 769–778 (1999).
  40. [40]Korsunsky, I. et al. Fast, sensitive and accurate integration of single-cell data with Harmony. Nature Methods 16, 1289–1296 (2019).DOI
  41. [41]Lee, D. et al. Single-cell atlas of transcriptomic vulnerability across multiple neurodegenerative and neuropsychiatric diseases. Preprint at medRxiv https://doi.org/10.1101/2024.10.31.24316513 (2024).
  42. [42]Reichart, D. et al. Pathogenic variants damage cell composition and single cell transcription in cardiomyopathies. Science 377, eabo1984 (2022).DOI
  43. [43]Romero, S., Kumar, V. S., Chapkin, R. S. & Cai, J. J. Quantum generative modeling of single-cell transcriptomes: capturing gene-gene and cell-cell interactions. Preprint at https://arxiv.org/abs/2510.12776 (2025).
  44. [44]Sohail, M. A., Sudharshan, R. R., Pradhan, S. S. & Rao, A. Quantum Hamiltonian-based generative modeling of single-cell transcriptomics for gene regulatory network inference. Preprint at bioRxiv https://doi.org/10.64898/2026.03.05.709897 (2026).
  45. [45]Zhao, H. et al. An exponential quantum advantage in processing massive classical data. Preprint at https://arxiv.org/abs/2604.07639 (2026).
  46. [46]Han, H. Ungovernable digital-medicine AI begins with preprocessing. SSRN 7542626, doi:10.2139/ssrn.7542626 (2026).DOI
  47. [47]McClean, J. R., Boixo, S., Smelyanskyi, V. N., Babbush, R. & Neven, H. Barren plateaus in quantum neural network training landscapes. Nature Communications 9, 4812 (2018).DOI
  48. [48]The Tabula Sapiens Consortium. Tabula Sapiens reveals transcription factor expression, senescence effects, and sex-specific features in cell types from 28 human organs and tissues. Preprint at bioRxiv https://doi.org/10.1101/2024.12.03.626516 (2025).
  49. [49]Parse Biosciences. 10 million human PBMCs in a single experiment. Dataset release 3 February 2026, https://www.parsebiosciences.com/datasets/10-million-human-pbmcs-in-a-single-experiment/ (accessed October 2026).
  50. [50]Moussa, M. & Måndoiu, I. I. Single cell RNA-seq data clustering using TF-IDF based methods. BMC Genomics 19, 569 (2018).DOI
  51. [51]Cusanovich, D. A. et al. Multiplex single-cell profiling of chromatin accessibility by combinatorial cellular indexing. Science 348, 910–914 (2015).DOI
  52. [52]Stuart, T. et al. Single-cell chromatin state analysis with Signac. Nature Methods 18, 1333–1341 (2021).DOI
  53. [53]Lehoucq, R. B., Sorensen, D. C. & Yang, C. ARPACK Users’ Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods (SIAM, 1998).DOI
  54. [54]Horn, J. L. A rationale and test for the number of factors in factor analysis. Psychometrika 30, 179–185 (1965).pubmed.ncbi.nlm.nih.gov/14306381
  55. [55]Roy, O. & Vetterli, M. The effective rank: a measure of effective dimensionality. In Proc. 15th European Signal Processing Conference (EUSIPCO) 606–610 (2007).
  56. [56]Berberich, J., Fink, D., Pranjić, D., Tutschku, C. & Holm, C. Training robust and generalizable quantum models. Physical Review Research 6, 043326 (2024).
  57. [57]Thanasip, S., Wang, S., Cerezo, M. & Holmes, Z. Exponential concentration in quantum kernel methods. Nature Communications 15, 5200 (2024).
  58. [58]Kuleshov, M. V. et al. Enrichr: a comprehensive gene set enrichment analysis web server 2016 update. Nucleic Acids Research 44, W90–W97 (2016).DOI
  59. [59]Szklarczyk, D. et al. The STRING database in 2023: protein–protein association networks and functional enrichment analyses for any sequenced genome of interest. Nucleic Acids Research 51, D638–D646 (2023).DOI
  60. [60]Cannon, M. et al. DGIdb 5.0: rebuilding the drug–gene interaction database for precision medicine and drug discovery platforms. Nucleic Acids Research 52, D1227–D1235 (2024).DOI
  61. [61]Strande, N. T. et al. Evaluating the clinical validity of gene–disease associations: an evidence-based framework developed by the Clinical Genome Resource. American Journal of Human Genetics 100, 895–906 (2017).
  62. [62]van der Maaten, L. & Hinton, G. Visualizing data using t-SNE. J. Mach. Learn. Res. 9, 2579–2605 (2008).
  63. [63]Poliĉar, P. G., Stražar, M. & Zupan, B. openTSNE: a modular Python library for t-SNE dimensionality reduction and embedding. J. Stat. Softw. 109, 1–30 (2024).DOI
  64. [64]Han, H., Niu, L., Li, D. & Wang, J. Differential rank preservation manifold learning. Preprint at arXiv https://arxiv.org/abs/2610.41107 (2026).
  65. [65]McInnes, L., Healy, J. & Melville, J. UMAP: uniform manifold approximation and projection for dimension reduction. arXiv 1802.03426 (2018).arxiv.org/abs/1802.03426
  66. [66]Traag, V. A., Waltman, L. & van Eck, N. J. F. From Louvain to Leiden: guaranteeing well-connected communities. Scientific Reports 9, 5233 (2019).DOI
  67. [67]Hubert, L. & Arabie, P. Comparing partitions. Journal of Classification 2, 193–218 (1985).DOI
  68. [68]Kerenidis, I., Landman, J., Luongo, A. & Prakash, A. q-means: a quantum algorithm for unsupervised machine learning. Advances in Neural Information Processing Systems 32 (2019).
  69. [69]Wei, N., Nie, Y., Liu, L., Zheng, X. & Wu, H.-J. Secuer: ultrafast, scalable and accurate clustering of single-cell RNA-seq data. PLoS Computational Biology 18, e1010753 (2022).DOI

Paper details

vlnc:W_gb4dccqw
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 13

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents