Variational quantum algorithm for anion exchange across electrolyzer membrane
- URL: http://arxiv.org/abs/2512.01120v1
- Date: Sun, 30 Nov 2025 22:26:31 GMT
- Title: Variational quantum algorithm for anion exchange across electrolyzer membrane
- Authors: Timur Gubaev, Philipp Pfeffer, Christian Dreßler, Jörg Schumacher,
- Abstract summary: We present a variational quantum algorithm that solves the one-dimensional diffusion problem with a space-dependent diffusion constant $D(x)$.<n>This problem is relevant for the exchange of hydroxide ions across a multi-layer membrane in an alkaline electrolyzer.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We present a variational quantum algorithm that solves the one-dimensional diffusion problem with a space-dependent diffusion constant $D(x)$. This problem is relevant for the exchange of hydroxide ions across a multi-layer membrane in an alkaline electrolyzer. We use $16$ to $64$ grid points across the membrane, resulting from $n=4$ to $6$ data qubits for the ideal quantum simulations that are based on the Qiskit software. For these qubit numbers, the depth of the parametric quantum circuit has been chosen to ensure sufficient expressibility. The state preparation requires particular attention since the diffusivity $D$ is piecewise constant in the different layers with discontinuities at the interface. Furthermore, we compare different classical optimization schemes with respect to their convergence in the VQA method. We demonstrate the applicability of the quantum algorithm to a problem with non-trivial boundary conditions and jump conditions of the diffusion constant and outline possible extensions of the proof-of-concept application case of quantum computing.
Related papers
- Topological control of quantum speed limits [55.2480439325792]
We show that even if the quantum state is completely dispersionless, QFI in this state remains momentum-resolved.<n>We find bounds on quantum speed limit which scales as $sqrt|C|$ in a (dispersionless) topological phase.
arXiv Detail & Related papers (2025-07-21T18:00:07Z) - Quantum simulation of Burgers turbulence: Nonlinear transformation and direct evaluation of statistical quantities [0.0]
It is still challenging to solve nonlinear equations in fluid dynamics, such as the Burgers equation, using quantum computers.<n>We propose a novel quantum algorithm to solve the Burgers equation.
arXiv Detail & Related papers (2024-12-23T01:17:26Z) - Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware [42.52549987351643]
Quantum homogenization is a reservoir-based quantum state approximation protocol.<n>We extend the standard quantum homogenization protocol to the dynamically-equivalent ($mathttSWAP$)$alpha$ formulation.<n>We show that our proposed protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable.
arXiv Detail & Related papers (2024-12-19T05:50:54Z) - Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
arXiv Detail & Related papers (2024-11-25T20:33:47Z) - The Quantum Esscher Transform [0.0]
We study the generalization of the Esscher Transform to the quantum setting.<n>We discuss potential applications of the quantum Esscher Transform.<n>Our algorithm is based on the modern techniques of block-encoding and quantum singular value transformation.
arXiv Detail & Related papers (2024-01-15T09:53:40Z) - Approximation Algorithms for Quantum Max-$d$-Cut [42.248442410060946]
The Quantum Max-$d$-Cut problem involves finding a quantum state that maximizes the expected energy associated with the projector onto the antisymmetric subspace of two, $d$-dimensional qudits over all local interactions.
We develop an algorithm that finds product-state solutions of mixed states with bounded purity that achieve non-trivial performance guarantees.
arXiv Detail & Related papers (2023-09-19T22:53:17Z) - Variational method for learning Quantum Channels via Stinespring Dilation on neutral atom systems [0.0]
We propose a method to approximate an arbitrary target quantum channel by variationally constructing equivalent unitary operations on an extended system.<n>We also present an experimentally feasible approach to extrapolate the quantum channel in discrete time steps beyond the period covered by the training data.
arXiv Detail & Related papers (2023-09-19T13:06:44Z) - GRAPE optimization for open quantum systems with time-dependent
decoherence rates driven by coherent and incoherent controls [77.34726150561087]
The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control.
We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls.
The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
arXiv Detail & Related papers (2023-07-17T13:37:18Z) - Variational Quantum Simulation of Partial Differential Equations:
Applications in Colloidal Transport [0.0]
We show that real-amplitude ansaetze with full circular entangling layers lead to higher-fidelity solutions.
To efficiently encode impulse functions, we propose a graphical mapping technique for quantum states.
arXiv Detail & Related papers (2023-07-14T05:51:57Z) - Quantum Computation of Phase Transition in Interacting Scalar Quantum
Field Theory [0.0]
It has been demonstrated that the critical point of the phase transition in scalar quantum field theory can be approximated via a Gaussian Effective Potential (GEP)
We perform quantum computations with various lattice sizes and obtain evidence of a transition from a symmetric to a symmetry-broken phase.
We implement the ten-site case on IBM quantum hardware using the Variational Quantum Eigensolver (VQE) algorithm to minimize the GEP.
arXiv Detail & Related papers (2023-03-04T14:11:37Z) - Quantum Davidson Algorithm for Excited States [42.666709382892265]
We introduce the quantum Krylov subspace (QKS) method to address both ground and excited states.
By using the residues of eigenstates to expand the Krylov subspace, we formulate a compact subspace that aligns closely with the exact solutions.
Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems.
arXiv Detail & Related papers (2022-04-22T15:03:03Z)
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.