Quantum Annealing with Qubit-Resonator Systems for Simultaneous Optimization of Binary and Continuous Variables

• URL: http://arxiv.org/abs/2506.20108v1
• Date: Wed, 25 Jun 2025 03:42:51 GMT
• Title: Quantum Annealing with Qubit-Resonator Systems for Simultaneous Optimization of Binary and Continuous Variables
• Abstract summary: We propose a hybrid system composed of qubits and resonators, aiming to minimize cost functions that contain both binary and continuous variables.<n>We present a general framework for hybrid quantum annealing using such systems, and investigate its feasibility and effectiveness through numerical simulations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum annealing is a method developed to solve combinatorial optimization problems by utilizing quantum bits. Solving such problems corresponds to minimizing a cost function defined over binary variables. However, in many practical cases, the cost function may also involve continuous variables. Representing continuous variables using quantum bits requires binary encoding, which demands a large number of qubits. To overcome this limitation, an approach using quantum resonators has been proposed, enabling the direct handling of continuous variables within the quantum annealing framework. On the other hand, certain optimization problems involve both binary and continuous variables simultaneously, and a quantum annealing method capable of efficiently solving such hybrid problems has not been established. Here, we propose a quantum annealing method based on a hybrid system composed of qubits and resonators, aiming to minimize cost functions that contain both binary and continuous variables. We present a general framework for hybrid quantum annealing using such systems, and investigate its feasibility and effectiveness through numerical simulations.

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)
• Sequential Quantum Computing [41.94295877935867]
  We propose and experimentally demonstrate sequential quantum computing (SQC), a paradigm that utilizes multiple or heterogeneous quantum processors.<n>SQC overcomes the limitations of each type of quantum computer by combining their complementary strengths.<n>These results highlight SQC as a powerful and versatile approach for addressing complex quantum optimization problems.
  arXiv  Detail & Related papers  (2025-06-25T17:51:29Z)
• 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)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• Parameterized quantum comb and simpler circuits for reversing unknown qubit-unitary operations [8.14510296131348]
  We propose PQComb to harness the full potential of quantum combs for diverse quantum process transformation tasks.<n>We present two streamlined protocols for the time-reversal simulation of unknown qubit unitary evolutions.<n>We also extend PQComb to solve the problems of qutrit unitary transformation and channel discrimination.
  arXiv  Detail & Related papers  (2024-03-06T14:53:24Z)
• 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)
• Parallel circuit implementation of variational quantum algorithms [0.0]
  We present a method to split quantum circuits of variational quantum algorithms (VQAs) to allow for parallel training and execution. We apply this specifically to optimization problems, where inherent structures from the problem can be identified. We show that not only can our method address larger problems, but that it is also possible to run full VQA models while training parameters using only one slice.
  arXiv  Detail & Related papers  (2023-04-06T12:52:29Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• A Quantum Approach for Stochastic Constrained Binary Optimization [2.6803492658436032]
  Quantum-based algorithms have been shown to generate high-quality solutions to hard problems. This work puts forth quantum vectors to cope with binary quadratically constrained programs. The method builds upon dual decomposition and entails solving a sequence of judiciously modified standard VQE tasks.
  arXiv  Detail & Related papers  (2023-01-04T04:24:26Z)
• Quantum amplitude damping for solving homogeneous linear differential equations: A noninterferometric algorithm [0.0]
  This work proposes a novel approach by using the Quantum Amplitude Damping operation as a resource, in order to construct an efficient quantum algorithm for solving homogeneous LDEs. We show that such an open quantum system-inspired circuitry allows for constructing the real exponential terms in the solution in a non-interferometric.
  arXiv  Detail & Related papers  (2021-11-10T11:25:32Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Numerical hardware-efficient variational quantum simulation of a soliton solution [0.0]
  We discuss the capabilities of quantum algorithms with special attention paid to a hardware-efficient variational eigensolver. A delicate interplay between magnetic interactions allows one to stabilize a chiral state that destroys the homogeneity of magnetic ordering. We argue that, while being capable of correctly reproducing a uniform magnetic configuration, the hardware-efficient ansatz meets difficulties in providing a detailed description to a noncollinear magnetic structure.
  arXiv  Detail & Related papers  (2021-05-13T11:58:18Z)

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.