Extension of the Jordan-Wigner mapping to nonorthogonal spin orbitals for quantum computing application to valence bond approaches

• URL: http://arxiv.org/abs/2509.12680v1
• Date: Tue, 16 Sep 2025 05:04:49 GMT
• Title: Extension of the Jordan-Wigner mapping to nonorthogonal spin orbitals for quantum computing application to valence bond approaches
• Authors: Alessia Marruzzo, Mosè Casalegno, Piero Macchi, Fabio Mascherpa, Bernardino Tirri, Guido Raos, Alessandro Genoni,
• Abstract summary: We propose an alternative Jordan-Wigner-type mapping tailored for the nonorthogonal case, with the goal of enabling efficient quantum simulations of VB-type wavefunctions.<n>An initial theoretical analysis and a preliminary application demonstrate the feasibility of this encoding and its potential for extending the applicability of VB methods to larger and more complex systems.
• Score: 33.72751145910978
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computing offers a promising platform to address the computational challenges inherent in quantum chemistry, and particularly in valence bond (VB) methods, which are chemically appealing but suffer from high computational cost due to the use of nonorthogonal orbitals. While various fermionic-to-spin mappings exist for orthonormal spin orbitals, such as the widely used Jordan-Wigner transformations, an analogous framework for nonorthogonal spin orbitals remains undeveloped. In this work, we propose an alternative Jordan-Wigner-type mapping tailored for the nonorthogonal case, with the goal of enabling efficient quantum simulations of VB-type wavefunctions. Our approach paves the way towards the development of chemically interpretable and computationally feasible valence bond algorithms on near-term quantum devices. An initial theoretical analysis and a preliminary application demonstrate the feasibility of this encoding and its potential for extending the applicability of VB methods to larger and more complex systems.

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)
• Heuristic ansatz design for trainable ion-native digital-analog quantum circuits [0.0]
  Variational quantum algorithms have become a standard approach for solving a wide range of problems on near-term quantum computers.<n>We propose a for identifying a problem-specific ansatz configuration, which enhances the trainability of the ion native digital-analog circuit.<n>The proposed approach is systematically applied to random instances of the Sherrington-Kirkpatrick Hamiltonian for up to 15 qubits, providing favorable cost landscapes.
  arXiv  Detail & Related papers  (2025-05-21T18:00:02Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Efficient Representation of Gaussian Fermionic Pure States in Non-Computational Bases [0.0]
  This paper introduces an innovative approach for representing Gaussian fermionic states, pivotal in quantum spin systems and fermionic models. We focus on transitioning these states from the conventional computational (sigmaz) basis to more complex bases, such as (phi, fracpi2, alpha) We present a novel algorithm that not only simplifies the basis transformation but also reduces computational complexity.
  arXiv  Detail & Related papers  (2024-03-05T19:43: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)
• The Bonsai algorithm: grow your own fermion-to-qubit mapping [0.7049738935364298]
  We present a formalism to design flexible fermion-to-qubit mappings from ternary trees. We introduce a recipe that guarantees Fock basis states are mapped to computational basis states in qubit space. We illustrate the algorithm by producing mappings for the heavy-hexagon topology widely used in IBM quantum computers.
  arXiv  Detail & Related papers  (2022-12-19T18:53:08Z)
• Fock-space Schrieffer--Wolff transformation: classically-assisted rank-reduced quantum phase estimation algorithm [0.0]
  In this paper, we focus on the Schrieffer--Wolff (SW) transformation of the electronic Hamiltonians for molecular systems. We demonstrate that by employing Fock-space variants of the SW transformation one can significantly increase the locality of the qubit-mapped similarity transformed Hamiltonians. The RRST formalism serves as a design principle for developing new classes of approximate schemes that reduce the complexity of quantum circuits.
  arXiv  Detail & Related papers  (2022-11-18T23:06:57Z)
• Benchmarking variational quantum eigensolvers for the square-octagon-lattice Kitaev model [3.6810704401578724]
  Quantum spin systems may offer the first opportunities for beyond-classical quantum computations of scientific interest. The variational quantum eigensolver (VQE) is a promising approach to finding energy eigenvalues on noisy quantum computers. We demonstrate the implementation of HVA circuits on Rigetti's Aspen-9 chip with error mitigation.
  arXiv  Detail & Related papers  (2021-08-30T16:58:43Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)

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.