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

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.01797

Quantum Representation Learning Beyond Pairwise Fidelity

Junpeng Hou, Changbin Lu

quant-phSubmitted Sep 1, 2026• Announced Sep 3, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum contrastive, metric, and self-supervised learning often expose encoded quantum states to the learner through transition probabilities, especially fidelity. Quantum states are known to possess higher-order relational invariants, but their consequences for learned representations remain unclear. Here we show that a transition-probability-only learning interface can possess exact continuous blind directions in certain quantum-state families. We recover this missing information with a batch operator, built from coherent overlap amplitudes and negative masking, where its second moment $q_-$ retains four-state interference. Moreover, $q_-$ is directly measurable through two-copy interference and can enter variational learning via methods like parameter shift. In relational quartets derived from toric-code and double-semion states, this fidelity-blind signal encodes inequivalent modular data despite identical pairwise fidelities. Finally, in a four-photon benchmark with preparation drift, augmenting all six pairwise fidelities at two orthogonal probes with the corresponding normalized $q_-$ reduces the mean out-of-distribution phase error by $86\%$ at equal total shot budget. These results establish multistate relational observables as measurable, trainable, and physically consequential signals for quantum representation learning beyond pairwise fidelity.

Comments
19 pages, 4 figures

Related papers

Quantum Machine Learning via Contrastive Training

Liudmila A. Zhukas, Vivian Ni Zhang, Qiang Miao +5 more

Quantum machine learning (QML) has attracted growing interest with the rapid parallel advances in large-scale classical machine learning and quantum technologies. Similar to classical machine learning, QML models also face challenges arising from the scarcity of labeled data, particularly as their scale and complexity increase. Here, we introduce self-supervised pretraining of quantum representations that reduces reliance on labeled data by learning invariances from unlabeled examples. We implement this paradigm on a programmable trapped-ion quantum computer, encoding images as quantum states. In situ contrastive pretraining on hardware yields a representation that, when fine-tuned, classifies image families with higher mean test accuracy and lower run-to-run variability than models trained from random initialization. Performance improvement is especially significant in regimes with limited labeled training data. We show that the learned invariances generalize beyond the pretraining image samples. Unlike prior work, our pipeline derives similarity from measured quantum overlaps and executes all training and classification stages on hardware. These results establish a label-efficient route to quantum representation learning, with direct relevance to quantum-native datasets and a clear path to larger classical inputs.

cs.LGCross-listedarXiv:2511.13497•Nov 18, 2025•1 citation

Adaptive Relational Learning on Multi-instance Quantum Data with Photonic Processors

Marcin Jastrzebski, Shang Yu, Raj B. Patel +1 more

Loading multiple quantum states in parallel into a quantum machine learning (QML) model can unlock learning tasks where key information resides in the \emph{relations} between states rather than in individual states. We introduce an adaptive relational learning framework for such multi-instance quantum data that accesses pairwise and higher-order relations. Our model combines global measurements via SWAP or CYCLE tests for evaluating an $n$-state Bargmann invariant with shallow trainable transformations applied locally to each input state. We demonstrate the approach for continuous-variable (CV) photonic systems, which naturally provide access to quantum data and necessary computing operations. We solve tasks involving hidden relationship detection, geometric phase classification, and sensing in the presence of an unknown shared nuisance interaction. We benchmark the adaptive model against a non-adaptive ``measure-first'' approach based on continuous-variable classical shadows, and show that the cost of shadow estimation grows rapidly with $n$, while our model avoids this dependence. Already for $n=2$, we achieve perfect test accuracy $A=1.0$ with $500$ inference shots, improving average test accuracy over the shadow-based method by $ΔA=0.15$ while using $100$ times fewer shots per data point. Our work opens routes to sensing and quantum-data applications where adaptive photonic QML can access relational features that are costly to recover with non-adaptive, measure-first models.

quant-pharXiv:2609.17352•Sep 16, 2026•2 citations

Resource-efficient quantum contrastive learning

Changbin Lu, Yue Ruan, Xu Wang +1 more

Efficient similarity estimation between quantum states remains a key bottleneck in quantum machine learning. While quantum fidelity provides a natural similarity measure, its evaluation typically relies on pairwise Swap Test circuits, leading to quadratic scaling with batch size. We propose Resource-efficient Quantum Contrastive Learning (ReQCL), a quantum-native framework that leverages coherent superposition to estimate global similarity. By preparing a batch-level superposition and extracting a batch-averaged fidelity from a single measurement, ReQCL avoids explicit pairwise evaluation and reduces the complexity from quadratic to linear in the batch size. We further introduce a fidelity-ratio objective that contrasts individual alignments against a global similarity baseline, enabling effective optimization of quantum representations. Numerical simulations suggest that the proposed approach learns meaningful embeddings in quantum state space. Our results show that global fidelity estimation via quantum superposition provides a scalable pathway for quantum representation learning.

EPJ Quantum Technology•Sep 11, 2026•0 citations

Self-Supervised Contrastive Learning in Quantum Latent Spaces for Few-Shot Domain Adaptation

Christianto Hernando

Few-shot domain adaptation remains fragile under compound distribution shifts because sparse target supervision amplifies representation noise and destabilizes metric structure. This study introduces self-supervised contrastive learning directly in a quantum latent space produced by a variational quantum circuit encoder, followed by prototype-driven adaptation with distribution alignment. Across three target shifts (style, temporal sparsity, and mixed covariate plus conditional drift), the proposed method achieved mean episodic accuracies of 0.721, 0.705, and 0.689 at 1-shot, increasing to 0.832, 0.813, and 0.806 at 5-shot, and 0.851, 0.836, and 0.826 at 10-shot, respectively. At K=5, average accuracy improved from 0.672 under ERM to 0.824 with the full quantum-contrastive model, with 95% confidence intervals tightening from ±0.018 to ±0.011. Representation diagnostics showed a reduction in intra-class dispersion from 0.412 to 0.301 and an increase in inter-class separation from 0.688 to 0.824, while seed variability decreased from 0.012 to 0.007. Circuit ablations identified an optimal depth range of 6–8 layers, where accuracy peaked at 0.824–0.829 before declining at higher depth with increased episodic variance. Robustness tests under finite-shot measurement revealed graceful degradation: under severe shift, accuracy rose from 0.709 at 64 shots per observable to 0.801 at 2048 shots, with failure episodes reduced from 4.2% to 2.9% when increasing from 256 to 1024 shots. These results indicate that quantum-measurement-bounded embeddings can stabilize contrastive geometry and improve few-shot transfer when target labels are scarce.

Journal of Quantum Artificial Intelligence•Oct 17, 2026•0 citations

Fidelity-Preserving Quantum Encoding for Quantum Neural Networks

Yuhu Lu, Jinjing Shi

Efficiently encoding classical visual data into quantum states is essential for realizing practical quantum neural networks (QNNs). However, existing encoding schemes often discard spatial and semantic information when adapting high-dimensional images to the limited qubits of Noisy Intermediate-Scale Quantum (NISQ) devices. We propose a Fidelity-Preserving Quantum Encoding (FPQE) framework that performs near lossless data compression and quantum encoding. FPQE employs a convolutional encoder-decoder to learn compact multi-channel representations capable of reconstructing the original data with high fidelity, which are then mapped into quantum states through amplitude encoding. Experimental results show that FPQE performs comparably to conventional methods on simple datasets such as MNIST, while achieving clear improvements on more complex ones, outperforming PCA and pruning based encodings by up to 10.2\% accuracy on Cifar-10. The performance gain grows with data complexity, demonstrating FPQE's ability to preserve high-level structural information across diverse visual domains. By maintaining fidelity during classical to quantum transformation, FPQE establishes a scalable and hardware efficient foundation for high-quality quantum representation learning.

quant-pharXiv:2511.15363•Nov 20, 2025•2 citations

Metric Learning with Quantum Feature Spaces

Sharma, Vinayak, Sen, Lord, Padhy, Ashish +4 more

The $2^N$ dimensions of Hilbert space give quantum metric learning exponentially many mutually orthogonal states with which to separate classes, but the same exponential dimension also degrades its optimization landscape and the tractability of evaluating its metric. By letting a classical network predict all gate parameters of a fixed ansatz, we isolate the reachable state manifold and its fidelity metric. We prove that this separability is already present on the unentangled manifold $\mathbb{M}_{\text{unentangled}} = (\mathbb{CP}^1)^N$, which saturates the $2^N$ maximal orthogonal capacity needed for classification, while entanglement adds states only at intermediate separations, which are costly to resolve under finite sampling. The same size carries costs. Global fidelity causes exponential gradient collapse across both unentangled ($Θ(c^{-N})$) and entangled ($Θ(4^{-N})$) manifolds; as fidelities concentrate, the fidelity signal-to-noise ratio at a fixed shot budget also decays exponentially in $N$; and because $\mathbb{M}_{\text{unentangled}}$ already holds $2^N$ orthogonal states, expressive, unconstrained encoders under contrastive losses reach trivial minima by \emph{geometric shattering} even without entanglement. We introduce Quantum Projective Metric Learning (QPMeL), an exact $O(N)$ closed-form kernel on $\mathbb{M}_{\text{unentangled}}$ that circumvents circuit simulation. QPMeL resolves gradient collapse via a curriculum annealing from a $1$-local observable regime (restoring $Θ(1/N^2)$ polynomial variance) to the global product kernel. Empirically, QPMeL as a complete design exceeds eight and matches two of 11 published quantum few-shot designs.

arXiv:2312.01655•Dec 4, 2023•1 citation
Quantum contrastive, metric, and self-supervised learning often expose encoded quantum states to the learner through transition probabilities, especially fidelity. Quantum states are known to possess higher-order relational invariants, but their consequences for learned representations remain unclear. Here we show that a transition-probability-only learning interface can possess exact continuous blind directions in certain quantum-state families. We recover this missing information with a batch operator, built from coherent overlap amplitudes and negative masking, where its second moment q−q_-q−​ retains four-state interference. Moreover, q−q_-q−​ is directly measurable through two-copy interference and can enter variational learning via methods like parameter shift. In relational quartets derived from toric-code and double-semion states, this fidelity-blind signal encodes inequivalent modular data despite identical pairwise fidelities. Finally, in a four-photon benchmark with preparation drift, augmenting all six pairwise fidelities at two orthogonal probes with the corresponding normalized q−q_-q−​ reduces the mean out-of-distribution phase error by 86%86\%86% at equal total shot budget. These results establish multistate relational observables as measurable, trainable, and physically consequential signals for quantum representation learning beyond pairwise fidelity.
Quantum machine learning (QML) has attracted growing interest with the rapid parallel advances in large-scale classical machine learning and quantum technologies. Similar to classical machine learning, QML models also face challenges arising from the scarcity of labeled data, particularly as their scale and complexity increase. Here, we introduce self-supervised pretraining of quantum representations that reduces reliance on labeled data by learning invariances from unlabeled examples. We implement this paradigm on a programmable trapped-ion quantum computer, encoding images as quantum states. In situ contrastive pretraining on hardware yields a representation that, when fine-tuned, classifies image families with higher mean test accuracy and lower run-to-run variability than models trained from random initialization. Performance improvement is especially significant in regimes with limited labeled training data. We show that the learned invariances generalize beyond the pretraining image samples. Unlike prior work, our pipeline derives similarity from measured quantum overlaps and executes all training and classification stages on hardware. These results establish a label-efficient route to quantum representation learning, with direct relevance to quantum-native datasets and a clear path to larger classical inputs.
Loading multiple quantum states in parallel into a quantum machine learning (QML) model can unlock learning tasks where key information resides in the \emph{relations} between states rather than in individual states. We introduce an adaptive relational learning framework for such multi-instance quantum data that accesses pairwise and higher-order relations. Our model combines global measurements via SWAP or CYCLE tests for evaluating an nnn-state Bargmann invariant with shallow trainable transformations applied locally to each input state. We demonstrate the approach for continuous-variable (CV) photonic systems, which naturally provide access to quantum data and necessary computing operations. We solve tasks involving hidden relationship detection, geometric phase classification, and sensing in the presence of an unknown shared nuisance interaction. We benchmark the adaptive model against a non-adaptive ``measure-first'' approach based on continuous-variable classical shadows, and show that the cost of shadow estimation grows rapidly with nnn, while our model avoids this dependence. Already for n=2n=2n=2, we achieve perfect test accuracy A=1.0A=1.0A=1.0 with 500500500 inference shots, improving average test accuracy over the shadow-based method by ΔA=0.15ΔA=0.15ΔA=0.15 while using 100100100 times fewer shots per data point. Our work opens routes to sensing and quantum-data applications where adaptive photonic QML can access relational features that are costly to recover with non-adaptive, measure-first models.
Efficient similarity estimation between quantum states remains a key bottleneck in quantum machine learning. While quantum fidelity provides a natural similarity measure, its evaluation typically relies on pairwise Swap Test circuits, leading to quadratic scaling with batch size. We propose Resource-efficient Quantum Contrastive Learning (ReQCL), a quantum-native framework that leverages coherent superposition to estimate global similarity. By preparing a batch-level superposition and extracting a batch-averaged fidelity from a single measurement, ReQCL avoids explicit pairwise evaluation and reduces the complexity from quadratic to linear in the batch size. We further introduce a fidelity-ratio objective that contrasts individual alignments against a global similarity baseline, enabling effective optimization of quantum representations. Numerical simulations suggest that the proposed approach learns meaningful embeddings in quantum state space. Our results show that global fidelity estimation via quantum superposition provides a scalable pathway for quantum representation learning.
Few-shot domain adaptation remains fragile under compound distribution shifts because sparse target supervision amplifies representation noise and destabilizes metric structure. This study introduces self-supervised contrastive learning directly in a quantum latent space produced by a variational quantum circuit encoder, followed by prototype-driven adaptation with distribution alignment. Across three target shifts (style, temporal sparsity, and mixed covariate plus conditional drift), the proposed method achieved mean episodic accuracies of 0.721, 0.705, and 0.689 at 1-shot, increasing to 0.832, 0.813, and 0.806 at 5-shot, and 0.851, 0.836, and 0.826 at 10-shot, respectively. At K=5, average accuracy improved from 0.672 under ERM to 0.824 with the full quantum-contrastive model, with 95% confidence intervals tightening from ±0.018 to ±0.011. Representation diagnostics showed a reduction in intra-class dispersion from 0.412 to 0.301 and an increase in inter-class separation from 0.688 to 0.824, while seed variability decreased from 0.012 to 0.007. Circuit ablations identified an optimal depth range of 6–8 layers, where accuracy peaked at 0.824–0.829 before declining at higher depth with increased episodic variance. Robustness tests under finite-shot measurement revealed graceful degradation: under severe shift, accuracy rose from 0.709 at 64 shots per observable to 0.801 at 2048 shots, with failure episodes reduced from 4.2% to 2.9% when increasing from 256 to 1024 shots. These results indicate that quantum-measurement-bounded embeddings can stabilize contrastive geometry and improve few-shot transfer when target labels are scarce.
Efficiently encoding classical visual data into quantum states is essential for realizing practical quantum neural networks (QNNs). However, existing encoding schemes often discard spatial and semantic information when adapting high-dimensional images to the limited qubits of Noisy Intermediate-Scale Quantum (NISQ) devices. We propose a Fidelity-Preserving Quantum Encoding (FPQE) framework that performs near lossless data compression and quantum encoding. FPQE employs a convolutional encoder-decoder to learn compact multi-channel representations capable of reconstructing the original data with high fidelity, which are then mapped into quantum states through amplitude encoding. Experimental results show that FPQE performs comparably to conventional methods on simple datasets such as MNIST, while achieving clear improvements on more complex ones, outperforming PCA and pruning based encodings by up to 10.2\% accuracy on Cifar-10. The performance gain grows with data complexity, demonstrating FPQE's ability to preserve high-level structural information across diverse visual domains. By maintaining fidelity during classical to quantum transformation, FPQE establishes a scalable and hardware efficient foundation for high-quality quantum representation learning.
The 2N2^N2N dimensions of Hilbert space give quantum metric learning exponentially many mutually orthogonal states with which to separate classes, but the same exponential dimension also degrades its optimization landscape and the tractability of evaluating its metric. By letting a classical network predict all gate parameters of a fixed ansatz, we isolate the reachable state manifold and its fidelity metric. We prove that this separability is already present on the unentangled manifold Munentangled=(CP1)N\mathbb{M}_{\text{unentangled}} = (\mathbb{CP}^1)^NMunentangled​=(CP1)N, which saturates the 2N2^N2N maximal orthogonal capacity needed for classification, while entanglement adds states only at intermediate separations, which are costly to resolve under finite sampling. The same size carries costs. Global fidelity causes exponential gradient collapse across both unentangled (Θ(c−N)Θ(c^{-N})Θ(c−N)) and entangled (Θ(4−N)Θ(4^{-N})Θ(4−N)) manifolds; as fidelities concentrate, the fidelity signal-to-noise ratio at a fixed shot budget also decays exponentially in NNN; and because Munentangled\mathbb{M}_{\text{unentangled}}Munentangled​ already holds 2N2^N2N orthogonal states, expressive, unconstrained encoders under contrastive losses reach trivial minima by \emph{geometric shattering} even without entanglement. We introduce Quantum Projective Metric Learning (QPMeL), an exact O(N)O(N)O(N) closed-form kernel on Munentangled\mathbb{M}_{\text{unentangled}}Munentangled​ that circumvents circuit simulation. QPMeL resolves gradient collapse via a curriculum annealing from a 111-local observable regime (restoring Θ(1/N2)Θ(1/N^2)Θ(1/N2) polynomial variance) to the global product kernel. Empirically, QPMeL as a complete design exceeds eight and matches two of 11 published quantum few-shot designs.