Co-Designing Spectral Transformation Oracles with Hybrid Oscillator-Qubit Quantum Processors: From Algorithms to Compilation

• URL: http://arxiv.org/abs/2502.16029v4
• Date: Fri, 07 Nov 2025 19:36:12 GMT
• Title: Co-Designing Spectral Transformation Oracles with Hybrid Oscillator-Qubit Quantum Processors: From Algorithms to Compilation
• Authors: Luke Bell, Yan Wang, Kevin C. Smith, Yuan Liu, Eugene Dumitrescu, S. M. Girvin,
• Abstract summary: We co-design a family of quantum eigenvalue transformation oracles that can be efficiently implemented on hybrid discrete/continuous-variable (qubit/qumode) hardware.<n>For completeness, we provide an end-to-end compilation which expresses high-level oracles in terms of an experimentally realizable instruction set architecture in both 1D and 2D.
• Score: 6.042189478747794
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We co-design a family of quantum eigenvalue transformation oracles that can be efficiently implemented on hybrid discrete/continuous-variable (qubit/qumode) hardware. To illustrate the oracle's representation-theoretic power and near-term experimental accessibility, we encode a Gaussian imaginary time evolution spectral filter. As a result, we define a continuous linear combination of unitaries block-encoding. Due to the ancillary qumode's infinite-dimensional nature, continuous variable qumodes constitute a powerful compilation tool for encoding continuous spectral functions without discretization errors while minimizing resource requirements. We then focus on the ubiquitous task of preparing eigenstates in quantum spin models. For completeness, we provide an end-to-end compilation which expresses high-level oracles in terms of an experimentally realizable instruction set architecture in both 1D and 2D. Finally, we examine the leading-order effects of physical errors and highlight open research directions. Our algorithms scale linearly with the spatial extent of the target system and are applicable to both near-term and large-scale quantum processors.

Related papers

• Oscillator-qubit generalized quantum signal processing for vibronic models: a case study of uracil cation [4.351505522514463]
  We present a compiler for hybrid oscillator-qubit processors, implementing state preparation and time evolution.<n>This compiler invokes generalized quantum signal processing (GQSP) to synthesize arbitrary bosonic phase gates.<n>We validate our method on the uracil cation, a canonical system whose accurate modeling requires anharmonic vibronic models.
  arXiv  Detail & Related papers  (2025-10-12T08:13:57Z)
• Quantum-Efficient Convolution through Sparse Matrix Encoding and Low-Depth Inner Product Circuits [0.0]
  We present a resource-efficient quantum algorithm that reformulates the convolution product as a structured matrix multiplication.<n>We construct a quantum framework wherein sparse input patches are prepared using optimized key-value QRAM state encoding.<n>Our architecture supports batched convolution across multiple filters using a generalized SWAP circuit.
  arXiv  Detail & Related papers  (2025-07-25T20:08:12Z)
• Synthesis of discrete-continuous quantum circuits with multimodal diffusion models [0.5277756703318045]
  Efficiently compiling quantum operations remains a major bottleneck in scaling quantum computing.<n>We introduce a multimodal denoising diffusion model that simultaneously generates a circuit's structure and its continuous parameters for compiling a target unitary.<n>We benchmark the model over different experiments, analyzing the method's accuracy across varying qubit counts, circuit depths, and proportions of parameterized gates.
  arXiv  Detail & Related papers  (2025-06-02T13:35:33Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks. We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings. We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Optimal multicore quantum computing with few interconnects [0.0]
  We study the complexity behavior of a paradigmatic universal family of random circuits distributed into several cores.<n>We find that the optimal complexity is reached with few interconnects.<n>We also analyze the complexity properties when scaling processors up by means of adding cores of the same size.
  arXiv  Detail & Related papers  (2025-01-17T15:23:54Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Efficient formulation of multitime generalized quantum master equations: Taming the cost of simulating 2D spectra [0.0]
  We present a formulation that greatly simplifies and reduces the computational cost of previous work that extended the GQME framework. Specifically, we remove the time derivatives of quantum correlation functions from the modified Mori-Nakajima-Zwanzig framework. We are also able to decompose the spectra into 1-, 2-, and 3-time correlations, showing how and when the system enters a Markovian regime.
  arXiv  Detail & Related papers  (2023-10-30T21:16:04Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Synthesis of and compilation with time-optimal multi-qubit gates [0.46180371154032884]
  We develop a class of entangling multi-qubit gates for a quantum computing platform with fixed Ising-type interaction with all-to-all connectivity. We numerically demonstrate that the total multi-qubit gate time scales approximately linear in the number of qubits.
  arXiv  Detail & Related papers  (2022-06-13T18:00:04Z)
• Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus [55.2480439325792]
  Coherent control of quantum computations can be used to improve some quantum protocols and algorithms. We refine the PBS-calculus, a graphical language for coherent control inspired by quantum optics.
  arXiv  Detail & Related papers  (2022-02-10T18:59:52Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Universal compiling and (No-)Free-Lunch theorems for continuous variable quantum learning [1.2891210250935146]
  We motivate several, closely related, short depth continuous variable algorithms for quantum compilation. We analyse the trainability of our proposed cost functions and demonstrate our algorithms by learning arbitrary numerically Gaussian operations. We make connections between this framework and quantum learning theory in the continuous variable setting by deriving No-Free-Lunch theorems.
  arXiv  Detail & Related papers  (2021-05-03T17:50:04Z)
• Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
  qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
  arXiv  Detail & Related papers  (2020-10-08T12:49:07Z)
• Quantum Ensemble for Classification [2.064612766965483]
  A powerful way to improve performance in machine learning is to construct an ensemble that combines the predictions of multiple models. We propose a new quantum algorithm that exploits quantum superposition, entanglement and interference to build an ensemble of classification models.
  arXiv  Detail & Related papers  (2020-07-02T11:26:54Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

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.