Can Constrained Quantum Annealing Be Effective in Noisy Quantum Annealers?

• URL: http://arxiv.org/abs/2410.17528v1
• Date: Wed, 23 Oct 2024 03:12:45 GMT
• Title: Can Constrained Quantum Annealing Be Effective in Noisy Quantum Annealers?
• Authors: Ryoya Igata, Myonsok I, Yuya Seki, Yuta Mizuno, Shohei Watabe,
• Abstract summary: We investigate the performance of penalty-based quantum annealing (PQA) and constrained quantum annealing (CQA) for graph partitioning problems. PQA generally demonstrates relatively stable success probabilities, while CQA's performance varies significantly across problem instances. CQA experiences leakage from the constraint-satisfying subspace under most noise models, with the exception of phase-flip noise.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate the performance of penalty-based quantum annealing (PQA) and constrained quantum annealing (CQA) in solving the graph partitioning problem under various noise models, including depolarizing, bit-flip, and phase-flip noise. We found that even in the absence of noise, the relative superiority of PQA or CQA is highly problem-dependent. PQA generally demonstrates relatively stable success probabilities, while CQA's performance varies significantly across problem instances. Notably, CQA experiences leakage from the constraint-satisfying subspace under most noise models, with the exception of phase-flip noise, where no leakage occurs exactly. The dependence of success probability on noise strength reveals that PQA consistently outperforms CQA in the weak noise regime, whereas CQA achieves higher success probabilities under strong phase-flip noise. However, even in this case, the overall success probability remains low, suggesting that CQA is not yet practical for noisy quantum annealers without the development of error-corrected quantum annealing and autonomous error correction techniques to address leakage from the constraint-satisfying subspace. To confine the system within the constraint subspace in CQA, error correction methods and cat code encoding will likely be required, both of which can suppress bit-flip errors.

Related papers

• Almost fault--tolerant quantum machine learning with drastic overhead reduction [1.481137211036747]
  This work proposes the idea of partial quantum error correction (QEC) for quantum machine learning (QML) models.<n>By assuming error-corrected two-qubit CNOTs (Clifford operations), we demonstrate that the QML models remain trainable even when single-qubit gates are subjected to depolarizing noise.
  arXiv  Detail & Related papers  (2025-07-25T04:43:37Z)
• Bayesian Quantum Amplitude Estimation [49.1574468325115]
  We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation. We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Investigating the Effect of Noise on the Training Performance of Hybrid Quantum Neural Networks [3.869198245725658]
  We analyze the influence of different quantum noise gates, including Phase Flip, Bit Flip, Phase Damping, Amplitude Damping, and the Depolarizing Channel. Our results reveal distinct and significant effects on HyQNNs training and validation accuracies across different probabilities of noise.
  arXiv  Detail & Related papers  (2024-02-13T15:26:19Z)
• IQP Sampling and Verifiable Quantum Advantage: Stabilizer Scheme and Classical Security [1.7586417032126085]
  We introduce a family of IQP sampling protocols called the emphstabilizer scheme, which builds on results linking IQP circuits, the stabilizer formalism, coding theory, and an efficient characterization of IQP circuit correlation functions. To assess classical security, we explore a class of attacks based on secret extraction, including the Kahanamoku-Meyer's attack as a special case.
  arXiv  Detail & Related papers  (2023-08-14T14:03:33Z)
• Matching Game for Optimized Association in Quantum Communication Networks [65.16483325184237]
  This paper proposes a swap-stable request-QS association algorithm for quantum switches. It achieves a near-optimal (within 5%) performance in terms of the percentage of served requests. It is shown to be scalable and maintain its near-optimal performance even when the size of the QCN increases.
  arXiv  Detail & Related papers  (2023-05-22T03:39:18Z)
• Noise-robust ground state energy estimates from deep quantum circuits [0.0]
  We show how the underlying energy estimate explicitly filters out incoherent noise in quantum algorithms. We implement QCM for a model of quantum magnetism on IBM Quantum hardware. We find that QCM maintains a remarkably high degree of error robustness where VQE completely fails.
  arXiv  Detail & Related papers  (2022-11-16T09:12:55Z)
• Error Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis [42.275148861039895]
  Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors. gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias. Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits. QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
  arXiv  Detail & Related papers  (2022-09-23T10:48:04Z)
• Evaluating the Resilience of Variational Quantum Algorithms to Leakage Noise [6.467585493563487]
  Leakage noise is a damaging source of error that error correction approaches cannot handle. The impact of this noise on the performance of variational quantum algorithms (VQAs) is yet unknown.
  arXiv  Detail & Related papers  (2022-08-10T14:50:14Z)
• Entanglement-assisted concatenated quantum codes [77.34669920414821]
  Entanglement-assistedd quantum codes (EACQCs) constructed by concatenating two quantum codes are proposed. EACQCs show several advantages over the standard quantum codes (CQCs) EACQCs are not only competitive in quantum communication but also applicable in fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2022-02-16T14:14:02Z)
• QuantumNAT: Quantum Noise-Aware Training with Noise Injection, Quantization and Normalization [22.900530292063348]
  Quantum Circuits (PQC) are promising towards quantum advantage on near-term quantum hardware. However, due to the large quantum noises (errors), the performance of PQC models has a severe degradation on real quantum devices. We present QuantumNAT, a PQC-specific framework to perform noise-aware optimizations in both training and inference stages to improve robustness.
  arXiv  Detail & Related papers  (2021-10-21T17:59:19Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• 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)
• On the learnability of quantum neural networks [132.1981461292324]
  We consider the learnability of the quantum neural network (QNN) built on the variational hybrid quantum-classical scheme. We show that if a concept can be efficiently learned by QNN, then it can also be effectively learned by QNN even with gate noise.
  arXiv  Detail & Related papers  (2020-07-24T06:34:34Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.