A Parameter-Efficient Quantum Anomaly Detection Method on a Superconducting Quantum Processor

• URL: http://arxiv.org/abs/2412.16867v3
• Date: Fri, 28 Mar 2025 10:57:32 GMT
• Title: A Parameter-Efficient Quantum Anomaly Detection Method on a Superconducting Quantum Processor
• Authors: Maida Wang, Jinyang Jiang, Peter V. Coveney,
• Abstract summary: We propose a novel quantum machine learning method, called.<n>the-Efficient Quantum Anomaly Detection (PEQAD), for practical image anomaly detection.<n>PEQAD aims to achieve both parameter efficiency and superior accuracy compared to classical models.<n>We demonstrate the first implementation of a quantum anomaly detection method for general image datasets on a superconducting quantum processor.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum machine learning has gained attention for its potential to address computational challenges. However, whether those algorithms can effectively solve practical problems and outperform their classical counterparts, especially on current quantum hardware, remains a critical question. In this work, we propose a novel quantum machine learning method, called Parameter-Efficient Quantum Anomaly Detection (PEQAD), for practical image anomaly detection, which aims to achieve both parameter efficiency and superior accuracy compared to classical models. Emulation results indicate that PEQAD demonstrates favourable recognition capabilities compared to classical baselines, achieving an average accuracy of over 90% on benchmarks with significantly fewer trainable parameters. Theoretical analysis confirms that PEQAD has a comparable expressivity to classical counterparts while requiring only a fraction of the parameters. Furthermore, we demonstrate the first implementation of a quantum anomaly detection method for general image datasets on a superconducting quantum processor. Specifically, we achieve an accuracy of over 80% with only 16 parameters on the device, providing initial evidence of PEQAD's practical viability in the noisy intermediate-scale quantum era and highlighting its significant reduction in parameter requirements.

Related papers

• Quantum phase classification via quantum hypothesis testing [0.39102514525861415]
  We propose a classification algorithm based on the quantum Neyman-Pearson test, which is theoretically optimal for distinguishing between two quantum states. Our results show that the proposed method achieves lower classification error probabilities and significantly reduces the training cost. These findings highlight the potential of quantum hypothesis testing as a powerful tool for quantum phase classification.
  arXiv  Detail & Related papers  (2025-04-05T08:23:45Z)
• Unsupervised Quantum Anomaly Detection on Noisy Quantum Processors [1.2325897339438878]
  We provide a systematic analysis of the generalization properties of the One-Class Support Vector Machine (OCSVM) algorithm. Results were theoretically simulated and experimentally validated on trapped-ion and superconducting quantum processors.
  arXiv  Detail & Related papers  (2024-11-25T22:42:38Z)
• Parametrized Energy-Efficient Quantum Kernels for Network Service Fault Diagnosis [0.49157446832511503]
  We show significant performance improvements and an efficient achievement of high performance over conventional methods. Experimental validation of the quantum kernel was conducted using IBM's superconducting quantum computer IBM-Kawasaki.
  arXiv  Detail & Related papers  (2024-05-15T23:06:47Z)
• Equivalence Checking of Parameterised Quantum Circuits [13.796569260568939]
  We propose a novel compact representation for PQCs based on tensor decision diagrams. We present an algorithm for verifying PQC equivalence without the need for instantiation.
  arXiv  Detail & Related papers  (2024-04-29T06:25:00Z)
• Mitigating Errors on Superconducting Quantum Processors through Fuzzy Clustering [38.02852247910155]
  A new Quantum Error Mitigation (QEM) technique uses Fuzzy C-Means clustering to specifically identify measurement error patterns. We report a proof-of-principle validation of the technique on a 2-qubit register, obtained as a subset of a real NISQ 5-qubit superconducting quantum processor. We demonstrate that the FCM-based QEM technique allows for reasonable improvement of the expectation values of single- and two-qubit gates based quantum circuits.
  arXiv  Detail & Related papers  (2024-02-02T14:02:45Z)
• A Hyperparameter Study for Quantum Kernel Methods [0.0]
  Quantum kernel methods are a promising method in quantum machine learning thanks to the guarantees connected to them. Their accessibility for analytic considerations also opens up the possibility of prescreening datasets based on their potential for a quantum advantage. Earlier works developed the geometric difference, which can be understood as a measure between two kernel-based machine learning approaches.
  arXiv  Detail & Related papers  (2023-10-18T11:20:59Z)
• 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)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• 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)
• A preprocessing perspective for quantum machine learning classification advantage using NISQ algorithms [0.0]
  Variational Quantum Algorithm (VQA) shows a gain of performance in balanced accuracy with the LDA technique. Current quantum computers are noisy and have few qubits to test, making it difficult to demonstrate the current and potential quantum advantage of QML methods.
  arXiv  Detail & Related papers  (2022-08-28T16:58:37Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.