Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1906.05118 · Digitale Welt

Nash embedding: a road map to realizing quantum hardware

Faisal Shah Khan

Published Dec 4, 2019• 0 citations
arXivHTMLPDF
DOI
10.1007/s42354-019-0241-4

Related papers

Nash Embedding and Equilibrium in Pure Quantums States

Faisal Shah Khan, Travis S. Humble

With respect to probabilistic mixtures of the strategies in non-cooperative games, quantum game theory provides guarantee of fixed-point stability, the so-called Nash equilibrium. This permits players to choose mixed quantum strategies that prepare mixed quantum states optimally under constraints. We show here that fixed-point stability of Nash equilibrium can also be guaranteed for pure quantum strategies via an application of the Nash embedding theorem, permitting players to prepare pure quantum states optimally under constraints.

•Aug 1, 2018•0 citations

Further Quantum Algorithms and Hardware

Bettina Just

Springer eBooks•Jan 1, 2022•0 citations

Hardware for a quantum network

Mika A. Sillanpää, Pertti Juhani Hakonen

Nature•Mar 1, 2014•7 citations

Scalable embedding of parity constraints in quantum annealing hardware

Michele Cattelan, Jemma Bennett, Sheir Yarkoni +1 more

One of the main bottlenecks in solving combinatorial optimization problems with quantum annealers is the qubit connectivity in the hardware. A possible solution for larger connectivity is minor embedding. This technique makes the geometrical properties of the combinatorial optimization problem, encoded as a Hamiltonian, match the properties of the quantum annealing hardware. The embedding itself is a hard computational problem, and therefore heuristic algorithms are required. In this work we present fixed, modular, and scalable embeddings that can be used to embed any combinatorial optimization problem described as an Ising Hamiltonian. These embeddings are the result of an extension of the well-known parity mapping, which has been used in the past to map higher-order Ising Hamiltonians to quadratic Hamiltonians, which are suitable for existing quantum hardware. We show how our new embeddings can be mapped to existing quantum annealers and that the embedded Hamiltonian physical properties match the original Hamiltonian properties.

arXiv:2405.14746•Physical Review A•Jan 23, 2025•4 citations

Quantum Computation: Overview

Mahn‐Soo Choi

Springer eBooks•Jan 1, 2022•0 citations

SIESTA-QCOMP: Bridging Classical and Quantum Computing for Strongly Correlated Systems

Yann Pouillon, Federico Marchesin, Ivano Tavernelli +1 more

Density Functional Theory (DFT) is the established workhorse of computational materials science, yet it faces fundamental challenges with strongly correlated electrons, such as in transition metal complexes and bond-breaking processes. While quantum computing offers a theoretically exact path to resolve these problems, current hardware limitations prohibit fully quantum simulations of realistic material systems. To bridge this gap, we present SIESTA-QCOMP, a modular suite embedding quantum methodologies within DFT. Harnessing SIESTA's localised basis set, we implement a projection-based embedding scheme that treats the bulk environment classically while mapping the strongly correlated "impurity" subspace to a quantum processor. The architecture uses a socket-based driver to orchestrate workflows between the Fortran-based SIESTA engine and Python-based frameworks like Qiskit, ensuring high interoperability. We detail the hybrid workflow, currently utilising a Variational Quantum Eigensolver (VQE), and discuss the road map toward methods such as Sample-based Quantum Diagonalisation (SQD). We illustrate the framework on an hypothetical iron porphyrin calculation and argue that such hybrid architectures are not merely interim solutions but essential foundations for integrating quantum utility into materials design, as envisioned by our broader QCOMP4DFT initiative.

arXiv:2610.24616•Oct 17, 2026•0 citations
With respect to probabilistic mixtures of the strategies in non-cooperative games, quantum game theory provides guarantee of fixed-point stability, the so-called Nash equilibrium. This permits players to choose mixed quantum strategies that prepare mixed quantum states optimally under constraints. We show here that fixed-point stability of Nash equilibrium can also be guaranteed for pure quantum strategies via an application of the Nash embedding theorem, permitting players to prepare pure quantum states optimally under constraints.
One of the main bottlenecks in solving combinatorial optimization problems with quantum annealers is the qubit connectivity in the hardware. A possible solution for larger connectivity is minor embedding. This technique makes the geometrical properties of the combinatorial optimization problem, encoded as a Hamiltonian, match the properties of the quantum annealing hardware. The embedding itself is a hard computational problem, and therefore heuristic algorithms are required. In this work we present fixed, modular, and scalable embeddings that can be used to embed any combinatorial optimization problem described as an Ising Hamiltonian. These embeddings are the result of an extension of the well-known parity mapping, which has been used in the past to map higher-order Ising Hamiltonians to quadratic Hamiltonians, which are suitable for existing quantum hardware. We show how our new embeddings can be mapped to existing quantum annealers and that the embedded Hamiltonian physical properties match the original Hamiltonian properties.
Density Functional Theory (DFT) is the established workhorse of computational materials science, yet it faces fundamental challenges with strongly correlated electrons, such as in transition metal complexes and bond-breaking processes. While quantum computing offers a theoretically exact path to resolve these problems, current hardware limitations prohibit fully quantum simulations of realistic material systems. To bridge this gap, we present SIESTA-QCOMP, a modular suite embedding quantum methodologies within DFT. Harnessing SIESTA's localised basis set, we implement a projection-based embedding scheme that treats the bulk environment classically while mapping the strongly correlated "impurity" subspace to a quantum processor. The architecture uses a socket-based driver to orchestrate workflows between the Fortran-based SIESTA engine and Python-based frameworks like Qiskit, ensuring high interoperability. We detail the hybrid workflow, currently utilising a Variational Quantum Eigensolver (VQE), and discuss the road map toward methods such as Sample-based Quantum Diagonalisation (SQD). We illustrate the framework on an hypothetical iron porphyrin calculation and argue that such hybrid architectures are not merely interim solutions but essential foundations for integrating quantum utility into materials design, as envisioned by our broader QCOMP4DFT initiative.