PolyQROM: Orthogonal-Polynomial-Based Quantum Reduced-Order Model for Flow Field Analysis

• URL: http://arxiv.org/abs/2504.21567v1
• Date: Wed, 30 Apr 2025 12:14:08 GMT
• Title: PolyQROM: Orthogonal-Polynomial-Based Quantum Reduced-Order Model for Flow Field Analysis
• Authors: Yu Fang, Cheng Xue, Tai-Ping Sun, Xiao-Fan Xu, Xi-Ning Zhuang, Yun-Jie Wang, Chuang-Chao Ye, Teng-Yang Ma, Jia-Xuan Zhang, Huan-Yu Liu, Yu-Chun Wu, Zhao-Yun Chen, Guo-Ping Guo,
• Abstract summary: Quantum computing promises exponential acceleration for fluid flow simulations.<n> measurement overhead required to extract flow features from quantum-encoded flow field data undermines this advantage.
• Score: 5.588958112139646
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing promises exponential acceleration for fluid flow simulations, yet the measurement overhead required to extract flow features from quantum-encoded flow field data fundamentally undermines this advantage--a critical challenge termed the ``output problem''. To address this, we propose an orthogonal-polynomial-based quantum reduced-order model (PolyQROM) that integrates orthogonal polynomial basis transformations with variational quantum circuits (VQCs). PolyQROM employs optimized polynomial-based quantum operations to compress flow field data into low-dimensional representations while preserving essential features, enabling efficient quantum or classical post-processing for tasks like reconstruction and classification. By leveraging the mathematical properties of orthogonal polynomials, the framework enhances circuit expressivity and stabilizes training compared to conventional hardware-efficient VQCs. Numerical experiments demonstrate PolyQROM's effectiveness in reconstructing flow fields with high fidelity and classifying flow patterns with accuracy surpassing classical methods and quantum benchmarks, all while reducing computational complexity and parameter counts. The work bridges quantum simulation outputs with practical fluid analysis, addressing the ``output problem'' through efficient reduced-order modeling tailored for quantum-encoded flow data, offering a scalable pathway to exploit quantum advantages in computational fluid dynamics.

Related papers

• EHands: Quantum Protocol for Polynomial Computation on Real-Valued Encoded States [0.18641315013048299]
  EHands protocol defines a universal set of quantum operations for multivariable transformations on quantum processors. We present a detailed implementation of $P_(x)$ using IBM's Heron-class quantum processors and an ideal Qiskit simulator.
  arXiv  Detail & Related papers  (2025-02-21T20:52:16Z)
• Quantum Simulation for Dynamical Transition Rates in Open Quantum Systems [0.0]
  We introduce a novel and efficient quantum simulation method to compute dynamical transition rates in Markovian open quantum systems. Our new approach holds the potential to surpass the bottlenecks of current quantum chemical research.
  arXiv  Detail & Related papers  (2024-12-23T02:53:05Z)
• Towards Variational Quantum Algorithms for generalized linear and nonlinear transport phenomena [0.0]
  This article proposes a Variational Quantum Algorithm (VQA) to solve linear and nonlinear thermofluid dynamic transport equations. The hybrid classical-quantum framework is applied to problems governed by the heat, wave, and Burgers' equation in combination with different engineering boundary conditions.
  arXiv  Detail & Related papers  (2024-11-22T13:39:49Z)
• 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)
• Circuit-Efficient Qubit-Excitation-based Variational Quantum Eigensolver [7.865137519552981]
  We present a circuit-efficient implementation of two-body Qubit-Excitation-Based (QEB) operator for building shallow-circuit wave function Ansatze. This work shows great promise for quantum simulations of electronic structures, leading to improved performance on current quantum hardware.
  arXiv  Detail & Related papers  (2024-06-17T16:16:20Z)
• Piecewise Polynomial Tensor Network Quantum Feature Encoding [0.0]
  This work introduces a novel method for embedding continuous variables into quantum circuits via piecewise features.<n>Our approach, termed Polynomial Network Quantum Feature TNQFE, aims to broaden the applicability of quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-12T14:26:33Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• 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)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• 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)
• 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)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)

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.