Pattern-Dependent Performance of the Bernstein-Vazirani Algorithm

• URL: http://arxiv.org/abs/2511.14821v1
• Date: Tue, 18 Nov 2025 15:36:14 GMT
• Title: Pattern-Dependent Performance of the Bernstein-Vazirani Algorithm
• Abstract summary: We present a benchmarking study of the Bernstein-Vazirani algorithm across 11 diverse test patterns on superconducting quantum processors.<n>Results reveal average success rates of 100.0% (ideal simulation), 85.2% (noisy emulation), and 26.4% (real hardware)<n>Quantum state tomography reveals a near-perfect correlation between pattern density and state fidelity degradation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Quantum computers promise to redefine the boundaries of computational science, offering the potential for exponential speedups in solving complex problems across chemistry, optimization, and materials science. Yet, their practical utility remains constrained by unpredictable performance degradation under real-world noise conditions. A key question is how problem structure itself influences algorithmic resilience. In this work, we present a comprehensive, hardware-aware benchmarking study of the Bernstein-Vazirani algorithm across 11 diverse test patterns on multiple superconducting quantum processors, revealing that algorithmic performance is exquisitely sensitive to problem structure. Our results reveal average success rates of 100.0\% (ideal simulation), 85.2\% (noisy emulation), and 26.4\% (real hardware), representing a dramatic 58.8\% average performance gap between noisy emulation and real hardware execution. With quantum state tomography confirming corresponding average state fidelities of 0.993, 0.760, and a 0.234 fidelity drop to hardware. Performance degrades dramatically from 75.7\% success for sparse patterns to complete failure for high-density 10-qubit patterns. Most strikingly, quantum state tomography reveals a near-perfect correlation between pattern density and state fidelity degradation, providing the fundamental explanation for observed performance patterns. The catastrophic fidelity collapse observed in real hardware measurements -- dropping to 0.111 compared to the predicted 0.763 -- underscores severe limitations in current noise models for capturing structure-dependent error mechanisms. Our work establishes pattern-dependent performance as a critical consideration for quantum algorithm deployment and provides a quantitative framework for predicting algorithm feasibility in practical applications.

Related papers

• GroverFigureOfMerit: An Agnostic Figure of Merit for Quantum Backend Characterization in the NISQ Era [41.99844472131922]
  We propose a Figure of Merit based on Grover's algorithm as an algorithmic stress test evaluating quantum backend performance holistically.<n>The metric combines success probability on target states with penalties for non-uniform amplification and leakage to non-marked states, yielding a unified score across hardware architectures.
  arXiv  Detail & Related papers  (2026-07-09T16:08:48Z)
• Towards Predictive Quantum Algorithmic Performance: Modeling Time-Correlated Noise at Scale [0.0]
  We quantify the effects of time-correlated noise on quantum algorithms and predict their performance at scale.<n>Our work paves the way for large-scale algorithmic simulations and performance prediction under hardware-relevant noise conditions.
  arXiv  Detail & Related papers  (2026-03-04T19:09:29Z)
• Rethinking Quantum Noise in Quantum Machine Learning: When Noise Improves Learning [5.083987940956758]
  Quantum noise is conventionally viewed as a fundamental obstacle in near-term quantum computing.<n>We present numerical evidence that challenges this consensus.<n>Through experiments on quantum graph neural networks for molecular property prediction, we discover that quantum noise induces heterogeneous responses.
  arXiv  Detail & Related papers  (2026-01-19T18:21:35Z)
• 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)
• Data-Efficient Quantum Noise Modeling via Machine Learning [0.3279176777295314]
  We introduce a data-efficient, machine learning-based framework to construct accurate, parameterized noise models for superconducting quantum processors.<n>We show that a model trained exclusively on small-scale circuits accurately predicts the behavior of larger validation circuits.
  arXiv  Detail & Related papers  (2025-09-16T10:30:28Z)
• Noise Hypernetworks: Amortizing Test-Time Compute in Diffusion Models [57.49136894315871]
  New paradigm of test-time scaling has yielded remarkable breakthroughs in reasoning models and generative vision models.<n>We propose one solution to the problem of integrating test-time scaling knowledge into a model during post-training.<n>We replace reward guided test-time noise optimization in diffusion models with a Noise Hypernetwork that modulates initial input noise.
  arXiv  Detail & Related papers  (2025-08-13T17:33:37Z)
• Designing lattice proteins with variational quantum algorithms [0.0]
  In inverse problem, protein design, one seeks sequences that fold to a given target structure.<n>Here, we investigate the utility of variational quantum algorithms for the first of these two steps on today's noisy quantum devices.
  arXiv  Detail & Related papers  (2025-08-04T12:55:01Z)
• Computational Performance Bounds Prediction in Quantum Computing with Unstable Noise [6.6884244790434195]
  Noise in quantum devices poses significant barriers to realizing this supremacy.<n>Next-generation quantum-centric supercomputing essentially requires efficient and accurate noise characterization.<n>We propose a data-driven workflow, namely QuBound, to predict computational performance bounds.
  arXiv  Detail & Related papers  (2025-07-22T22:00:09Z)
• Handling Label Noise via Instance-Level Difficulty Modeling and Dynamic Optimization [40.87754131017707]
  Deep neural networks degrade in generalization performance under noisy supervision.<n>Existing methods focus on isolating clean subsets or correcting noisy labels.<n>We propose a novel two-stage noisy learning framework that enables instance-level optimization.
  arXiv  Detail & Related papers  (2025-05-01T19:12:58Z)
• Task-Oriented Real-time Visual Inference for IoVT Systems: A Co-design Framework of Neural Networks and Edge Deployment [61.20689382879937]
  Task-oriented edge computing addresses this by shifting data analysis to the edge. Existing methods struggle to balance high model performance with low resource consumption. We propose a novel co-design framework to optimize neural network architecture.
  arXiv  Detail & Related papers  (2024-10-29T19:02:54Z)
• Quantum noise modeling through Reinforcement Learning [38.47830254923108]
  We introduce a machine learning approach to characterize the noise impacting a quantum chip and emulate it during simulations.<n>Our algorithm leverages reinforcement learning, offering increased flexibility in reproducing various noise models.<n>The effectiveness of the RL agent has been validated through simulations and testing on real superconducting qubits.
  arXiv  Detail & Related papers  (2024-08-02T18:05:21Z)
• RobustMQ: Benchmarking Robustness of Quantized Models [54.15661421492865]
  Quantization is an essential technique for deploying deep neural networks (DNNs) on devices with limited resources. We thoroughly evaluated the robustness of quantized models against various noises (adrial attacks, natural corruptions, and systematic noises) on ImageNet. Our research contributes to advancing the robust quantization of models and their deployment in real-world scenarios.
  arXiv  Detail & Related papers  (2023-08-04T14:37:12Z)
• Robustness of Variational Quantum Algorithms against stochastic parameter perturbation [0.0]
  Variational quantum algorithms are tailored to perform within the constraints of current quantum devices. We consider a noise model that reflects realistic gate errors inherent to variational quantum algorithms. We show that certain gate errors have a significantly smaller impact on the coherence of the state, allowing us to reduce the execution time without compromising performance.
  arXiv  Detail & Related papers  (2022-12-30T20:36:29Z)
• Error-aware Quantization through Noise Tempering [43.049102196902844]
  Quantization-aware training (QAT) optimize model parameters with respect to the end task while simulating quantization error. In this work, we incorporate exponentially decaying quantization-error-aware noise together with a learnable scale of task loss gradient to approximate the effect of a quantization operator. Our method obtains state-of-the-art top-1 classification accuracy for uniform (non mixed-precision) quantization, out-performing previous methods by 0.5-1.2% absolute.
  arXiv  Detail & Related papers  (2022-12-11T20:37:50Z)
• Characterizing and mitigating coherent errors in a trapped ion quantum processor using hidden inverses [0.20315704654772418]
  Quantum computing testbeds exhibit high-fidelity quantum control over small collections of qubits. These noisy intermediate-scale devices can support a sufficient number of sequential operations prior to decoherence. While the results of these algorithms are imperfect, these imperfections can help bootstrap quantum computer testbed development.
  arXiv  Detail & Related papers  (2022-05-27T20:35:24Z)
• Multiplicative noise and heavy tails in stochastic optimization [62.993432503309485]
  empirical optimization is central to modern machine learning, but its role in its success is still unclear. We show that it commonly arises in parameters of discrete multiplicative noise due to variance. A detailed analysis is conducted in which we describe on key factors, including recent step size, and data, all exhibit similar results on state-of-the-art neural network models.
  arXiv  Detail & Related papers  (2020-06-11T09:58:01Z)

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.