Multi-channel convolutional neural quantum embedding

• URL: http://arxiv.org/abs/2509.22355v1
• Date: Fri, 26 Sep 2025 13:51:40 GMT
• Title: Multi-channel convolutional neural quantum embedding
• Authors: Yujin Kim, Changjae Im, Taehyun Kim, Tak Hur, Daniel K. Park,
• Abstract summary: We introduce a classical-quantum hybrid approach for optimizing quantum embedding beyond the limitations of the standard circuit model of quantum computation.<n>We benchmark the performance of various models in our framework using the CIFAR-10 and Tiny ImageNet datasets.
• Score: 10.620759775107787
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Classification using variational quantum circuits is a promising frontier in quantum machine learning. Quantum supervised learning (QSL) applied to classical data using variational quantum circuits involves embedding the data into a quantum Hilbert space and optimizing the circuit parameters to train the measurement process. In this context, the efficacy of QSL is inherently influenced by the selection of quantum embedding. In this study, we introduce a classical-quantum hybrid approach for optimizing quantum embedding beyond the limitations of the standard circuit model of quantum computation (i.e., completely positive and trace-preserving maps) for general multi-channel data. We benchmark the performance of various models in our framework using the CIFAR-10 and Tiny ImageNet datasets and provide theoretical analyses that guide model design and optimization.

Related papers

• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• An Amplitude-Encoding-Based Classical-Quantum Transfer Learning framework: Outperforming Classical Methods in Image Recognition [8.971481563534537]
  This paper proposes an amplitude-encoding-based classical-quantum transfer learning (AE-CQTL) framework, accompanied by an effective learning algorithm.<n>Based on the AE-CQTL framework, we designed and implemented two CQTL neural network models: Transfer learning Quantum Neural Network (TLQNN) and Transfer Learning Quantum Convolutional Neural Network (TLQCNN)
  arXiv  Detail & Related papers  (2025-02-27T15:20:01Z)
• Quantum Data Encoding and Variational Algorithms: A Framework for Hybrid Quantum Classical Machine Learning [0.0]
  Quantum Machine Learning (QML) integrates the calculational framework of quantum mechanics with the adaptive properties of classical machine learning.<n>This article suggests a broad architecture that allows the connection between classical data pipelines and quantum algorithms.
  arXiv  Detail & Related papers  (2025-02-17T16:04:04Z)
• Benefiting from Quantum? A Comparative Study of Q-Seg, Quantum-Inspired Techniques, and U-Net for Crack Segmentation [41.01256771536732]
  This study evaluates the performance of quantum and quantum-inspired methods compared to classical models for crack segmentation. Our results indicate that quantum-inspired and quantum methods offer a promising alternative for image segmentation, particularly for complex crack patterns, and could be applied in near-future applications.
  arXiv  Detail & Related papers  (2024-10-14T16:51:59Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Pre-training Tensor-Train Networks Facilitates Machine Learning with Variational Quantum Circuits [70.97518416003358]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning on noisy intermediate-scale quantum (NISQ) devices. While tensor-train networks (TTNs) can enhance VQC representation and generalization, the resulting hybrid model, TTN-VQC, faces optimization challenges due to the Polyak-Lojasiewicz (PL) condition. To mitigate this challenge, we introduce Pre+TTN-VQC, a pre-trained TTN model combined with a VQC.
  arXiv  Detail & Related papers  (2023-05-18T03:08:18Z)
• Quantum machine learning for image classification [39.58317527488534]
  This research introduces two quantum machine learning models that leverage the principles of quantum mechanics for effective computations. Our first model, a hybrid quantum neural network with parallel quantum circuits, enables the execution of computations even in the noisy intermediate-scale quantum era. A second model introduces a hybrid quantum neural network with a Quanvolutional layer, reducing image resolution via a convolution process.
  arXiv  Detail & Related papers  (2023-04-18T18:23:20Z)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Quantum Neural Architecture Search with Quantum Circuits Metric and Bayesian Optimization [2.20200533591633]
  We propose a new quantum gates distance that characterizes the gates' action over every quantum state. Our approach significantly outperforms the benchmark on three empirical quantum machine learning problems.
  arXiv  Detail & Related papers  (2022-06-28T16:23:24Z)
• Optimal quantum kernels for small data classification [0.0]
  We show an algorithm for constructing quantum kernels for support vector machines that adapts quantum gate sequences to data. The performance of the resulting quantum models for classification problems with a small number of training points significantly exceeds that of optimized classical models.
  arXiv  Detail & Related papers  (2022-03-25T18:26:44Z)
• Variational Quantum Policy Gradients with an Application to Quantum Control [0.0]
  Quantum Machine Learning models are composed by Variational Quantum Circuits (VQCs) in a very natural way. In this work, we consider Policy Gradients using a hardware-efficient ansatz. We prove that the complexity of obtaining an epsilon-approximation of the gradient using quantum hardware scales only logarithmically with the number of parameters.
  arXiv  Detail & Related papers  (2022-03-20T16:14:49Z)

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.