A generalized variational quantum linear solver on photonic platform

• URL: http://arxiv.org/abs/2607.14477v1
• Date: Thu, 16 Jul 2026 01:49:19 GMT
• Title: A generalized variational quantum linear solver on photonic platform
• Abstract summary: We experimentally validate a generalized variational quantum linear solver (VQLS) based on a photonic computing platform.<n>In addition to solving non-singular systems that admit a unique solution, we investigate ill-conditioned problems arising from singularity.<n>We extend the VQLS to the finite field F2 by redesigning the cost function to incorporate modulo 2 and imposing several constraints on the solution vector.
• Score: 2.2465651033790475
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Based on a photonic computing platform, we experimentally validate a generalized variational quantum linear solver (VQLS) by systematically solving four-dimensional linear equation systems across different fields. In the complex field, in addition to solving non-singular systems that admit a unique solution, we investigate ill-conditioned problems arising from singularity--an issue frequently encountered in practical applications. To tackle these challenges, we introduce perturbation terms, a treatment inspired by Tikhonov regularization, and develop an algorithm capable of handling a wide range of systems. Furthermore, we extend the VQLS to the finite field F2 by redesigning the cost function to incorporate modulo 2 and imposing several constraints on the solution vector. This modulo 2 VQLS is inherently free from singularity. It is adapt to stabilizer coding theory and may find applications in areas such as decoders and the design of quantum gate sequences. Therefore, our work demonstrates the practical potential of VQLS in quantum computing, providing a solid experimental foundation and methodological guidance for its real-world applications.

Related papers

• A Quantum Spectral Framework for Solving PDEs [0.0]
  Partial differential equations (PDEs) are fundamental across numerous scientific fields.<n>Attempts to solve this problem typically rely on either classical sparsity and low-rank decompositions.<n>Quantum Computing offers a promising alternative, as it allows us to operate in significantly larger spaces.
  arXiv  Detail & Related papers  (2026-04-28T16:33:59Z)
• Solving wave equation problems on D-Wave quantum annealers [44.99833362998488]
  We solve the one-dimensional Helmholtz equation in several scenarios using the quantum annealer provided by the D-Wave systems within a pseudospectral scheme.<n>We assess the performance of different strategies of encoding based on algebraic arguments and the adiabatic condition.
  arXiv  Detail & Related papers  (2025-07-18T08:06:43Z)
• Variational quantum and neural quantum states algorithms for the linear complementarity problem [1.2796203864160849]
  Variational quantum algorithms (VQAs) are promising hybrid quantum-classical methods.<n>We present a novel application of the variational quantum linear solver (VQLS) and its classical neural quantum states-based counterpart, the variational neural linear solver (VNLS)<n>We demonstrate using the VNLS that our solver accurately simulates the dynamics of rigid spherical bodies during collision events.
  arXiv  Detail & Related papers  (2025-04-10T22:03:14Z)
• Variational quantum algorithm based on Lagrange polynomial encoding to solve differential equations [0.0]
  We introduce two different architectures of a novel variational quantum algorithm (VQA) with Lagrange encoding in combination with derivative quantum circuits.<n>It is shown that the proposed new VQA has a reduced gate complexity compared to previous variational quantum algorithms, for a similar or better quality of the solution.
  arXiv  Detail & Related papers  (2024-07-23T10:11:44Z)
• Nonlinear dynamics as a ground-state solution on quantum computers [39.58317527488534]
  We present variational quantum algorithms (VQAs) that encode both space and time in qubit registers. The spacetime encoding enables us to obtain the entire time evolution from a single ground-state computation.
  arXiv  Detail & Related papers  (2024-03-25T14:06:18Z)
• New spectral-parameter dependent solutions of the Yang-Baxter equation [45.31975029877049]
  The Yang-Baxter Equation (YBE) plays a crucial role for studying integrable many-body quantum systems. New solutions of the YBE could be used to construct new interesting 1D quantum or 2D classical systems.
  arXiv  Detail & Related papers  (2024-01-23T12:19:48Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization [44.96576908957141]
  We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linear iterations problems on quantum computers.
  arXiv  Detail & Related papers  (2022-03-23T18:00:03Z)
• Solving systems of Boolean multivariate equations with quantum annealing [1.1699027359021665]
  Polynomial systems over the binary field have important applications in cryptography, coding theory, and computer algebra. We present different methodologies to embed the problem into a Hamiltonian that can be solved by available quantum annealing platforms. We design a machine-agnostic algorithm that adopts an iterative approach to better solve the problem Hamiltonian by repeatedly reducing the search space.
  arXiv  Detail & Related papers  (2021-11-25T19:00:12Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• Polynomial unconstrained binary optimisation inspired by optical simulation [52.11703556419582]
  We propose an algorithm inspired by optical coherent Ising machines to solve the problem of unconstrained binary optimization. We benchmark the proposed algorithm against existing PUBO algorithms, and observe its superior performance. The application of our algorithm to protein folding and quantum chemistry problems sheds light on the shortcomings of approxing the electronic structure problem by a PUBO problem.
  arXiv  Detail & Related papers  (2021-06-24T16:39:31Z)
• Modeling Linear Inequality Constraints in Quadratic Binary Optimization for Variational Quantum Eigensolver [0.0]
  This paper introduces the use of tailored variational forms for variational quantum eigensolver. Four constraints that usually appear in several optimization problems are modeled. The main advantage of the proposed methodology is that the number of parameters on the variational form remain constant.
  arXiv  Detail & Related papers  (2020-07-26T23:36:22Z)

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.