QuCoWE Quantum Contrastive Word Embeddings with Variational Circuits for NearTerm Quantum Devices

• URL: http://arxiv.org/abs/2511.10179v1
• Date: Fri, 14 Nov 2025 01:37:27 GMT
• Title: QuCoWE Quantum Contrastive Word Embeddings with Variational Circuits for NearTerm Quantum Devices
• Abstract summary: We present a framework that learns quantumnative word embeddings by training shallow hardwareefficient parameterized quantum circuits PQCs with a contrastive skipgram objective.<n>Words are encoded by datareuploading circuits with controlled ring entanglement similarity is computed via quantum state fidelity and passed through a logitfidelity head.
• Score: 3.9523001246697813
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We present QuCoWE a framework that learns quantumnative word embeddings by training shallow hardwareefficient parameterized quantum circuits PQCs with a contrastive skipgram objective Words are encoded by datareuploading circuits with controlled ring entanglement similarity is computed via quantum state fidelity and passed through a logitfidelity head that aligns scores with the shiftedPMI scale of SGNSNoiseContrastive Estimation To maintain trainability we introduce an entanglementbudget regularizer based on singlequbit purity that mitigates barren plateaus On Text8 and WikiText2 QuCoWE attains competitive intrinsic WordSim353 SimLex999 and extrinsic SST2 TREC6 performance versus 50100d classical baselines while using fewer learned parameters per token All experiments are run in classical simulation we analyze depolarizingreadout noise and include errormitigation hooks zeronoise extrapolation randomized compiling to facilitate hardware deployment

Related papers

• Designing quantum technologies with a quantum computer [1.4951795042951048]
  We develop a quantum-computer-aided framework for simulating devices using a general electron spin resonance Hamiltonian.<n>Within this model, we combine Gray-encoded qudit-to-qubit mappings, qubit-wise commuting aggregation, and a multi-reference selected quantum Krylov fast-forwarding algorithm.<n> Numerical simulations demonstrate the computation of autocorrelation functions up to $sim100$ ns, together with microwave absorption spectra.<n>We benchmark the framework against classical simulations and identify the reference-state selection in sQKFF as the primary factor governing accuracy at fixed hardware cost.
  arXiv  Detail & Related papers  (2026-01-29T18:26:54Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Bridging quantum and classical computing for partial differential equations through multifidelity machine learning [0.46664938579243564]
  Quantum algorithms for partial differential equations (PDEs) face severe practical constraints on near-term hardware.<n>We introduce a multifidelity learning framework that corrects coarse quantum solutions to high-fidelity accuracy using sparse classical training data.
  arXiv  Detail & Related papers  (2025-12-04T20:39:23Z)
• Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits [1.9573380763700712]
  We propose an exact sampling algorithm that integrates tensor network contraction techniques with a Markov process.<n>As a demonstration, we target the challenge of generating samples from ideal and noisy QAOA circuits with up to 476 qubits.
  arXiv  Detail & Related papers  (2025-10-28T09:33:11Z)
• CLAQS: Compact Learnable All-Quantum Token Mixer with Shared-ansatz for Text Classification [25.923244871975058]
  We present CLAQS, a compact, fully quantum token mixer for text classification.<n>We apply l1 normalization to regulate amplitude scaling and introduce a two-stage parameterized quantum architecture.<n> operating under a sliding-window regime, CLAQS requires only eight data qubits and shallow circuits, yet achieves 91.64% accuracy on SST-2 and 87.08% on IMDB.
  arXiv  Detail & Related papers  (2025-10-08T00:20:08Z)
• Machine Learning for Quantum Noise Reduction [0.0]
  We propose a machine learning approach that directly reconstructs clean quantum states from noisy density matrices without additional qubits.<n>We formulate quantum noise reduction as a supervised learning problem using a convolutional neural network (CNN) autoencoder architecture.<n>Our results suggest that CNN-based density matrix reconstruction offers a promising, resource-efficient alternative to traditional quantum error correction.
  arXiv  Detail & Related papers  (2025-09-17T00:13:07Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Quantum Wasserstein Compilation: Unitary Compilation using the Quantum Earth Mover's Distance [2.502222151305252]
  quantum circuit compilation (QCC) is a crucial component of any quantum algorithm execution.<n>We present a VQCC-objective function called the quantum Wasserstein compilation (QWC) cost function based on the quantum Wasserstein distance of order 1.<n>An estimation method based on measurements of local Pauli-observable is utilized in a generative adversarial network to learn a given quantum circuit.
  arXiv  Detail & Related papers  (2024-09-09T17:46:40Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.