Quantum Approximate Walk Algorithm

• URL: http://arxiv.org/abs/2511.07676v1
• Date: Wed, 12 Nov 2025 01:10:40 GMT
• Title: Quantum Approximate Walk Algorithm
• Authors: Ziqing Guo, Jan Balewski, Wenshuo Hu, Alex Khan, Ziwen Pan,
• Abstract summary: We present a classical data-traceable quantum oracle characterized by a circuit depth that increases linearly with the number of qubits.<n>By establishing an inferable mapping between the classical input and quantum circuit outcomes, we obtained experimental results on the state-of-the-art IBM hardware.
• Score: 0.6306978246081341
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The encoding of classical to quantum data mapping through trigonometric functions within arithmetic-based quantum computation algorithms leads to the exploitation of multivariate distributions. The studied variational quantum gate learning mechanism, which relies on agnostic gradient optimization, does not offer algorithmic guarantees for the correlation of results beyond the measured bitstring outputs. Consequently, existing methodologies are inapplicable to this problem. In this study, we present a classical data-traceable quantum oracle characterized by a circuit depth that increases linearly with the number of qubits. This configuration facilitates the learning of approximate result patterns through a shallow quantum circuit (SQC) layout. Moreover, our approach demonstrates that the classical preprocessing of mid-quantum measurement data enhances the interpretability of quantum approximate optimization algorithm (QAOA) outputs without requiring full quantum state tomography. By establishing an inferable mapping between the classical input and quantum circuit outcomes, we obtained experimental results on the state-of-the-art IBM Pittsburgh hardware, which yielded polynomial-time verification of the solution quality. This hybrid framework bridges the gap between near-term quantum capabilities and practical optimization requirements, offering a pathway toward reliable quantum-classical algorithms for industrial applications.

Related papers

• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• 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)
• Classical post-processing approach for quantum amplitude estimation [0.0]
  We propose an approach for quantum amplitude estimation (QAE) designed to enhance computational efficiency while minimizing the reliance on quantum resources.<n>Our method leverages quantum computers to generate a sequence of signals, from which the quantum amplitude is inferred through classical post-processing techniques.
  arXiv  Detail & Related papers  (2025-02-08T15:51:31Z)
• 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)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Enhancing Quantum Annealing in Digital-Analog Quantum Computing [0.0]
  Digital-analog quantum computing (DAQC) offers a promising approach to addressing the challenges of building a practical quantum computer. We propose an algorithm designed to enhance the performance of quantum annealing. This study provides an example of how processing quantum data using a quantum circuit can outperform classical data processing, which discards quantum information.
  arXiv  Detail & Related papers  (2023-06-03T09:16:15Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Fundamental limitations on optimization in variational quantum algorithms [7.165356904023871]
  A leading paradigm to establish such near-term quantum applications is variational quantum algorithms (VQAs) We prove that for a broad class of such random circuits, the variation range of the cost function vanishes exponentially in the number of qubits with a high probability. This result can unify the restrictions on gradient-based and gradient-free optimizations in a natural manner and reveal extra harsh constraints on the training landscapes of VQAs.
  arXiv  Detail & Related papers  (2022-05-10T17:14:57Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Limitations of variational quantum algorithms: a quantum optimal transport approach [11.202435939275675]
  We obtain extremely tight bounds for standard NISQ proposals in both the noisy and noiseless regimes. The bounds limit the performance of both circuit model algorithms, such as QAOA, and also continuous-time algorithms, such as quantum annealing.
  arXiv  Detail & Related papers  (2022-04-07T13:58:44Z)
• Identification of topological phases using classically-optimized variational quantum eigensolver [0.6181093777643575]
  Variational quantum eigensolver (VQE) is regarded as a promising candidate of hybrid quantum-classical algorithm for quantum computers. We propose classically-optimized VQE (co-VQE), where the whole process of the optimization is efficiently conducted on a classical computer. In co-VQE, we only use quantum computers to measure nonlocal quantities after the parameters are optimized.
  arXiv  Detail & Related papers  (2022-02-07T02:26:58Z)

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.