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:1811.09453 · Lobachevskii Journal of Mathematics

Entangling Problem Hamiltonian for Adiabatic Quantum Computation

Oleg Valentinovich Lychkovskiy

Published Jul 1, 2022• 2 citations
arXivHTMLPDF

Abstract

Abstract Adiabatic quantum computation starts from embedding a computational problem into a Hamiltonian whose ground state encodes the solution to the problem. This problem Hamiltonian is normally chosen to be diagonal in the computational basis, that is a product basis for qubits. We demonstrate that, in fact, a problem Hamiltonian can always be chosen to be non-diagonal in the computational basis. To be more precise, we show how to construct a problem Hamiltonian in such a way that all its excited states are entangled with respect to the qubit tensor product structure, while the ground state is still of the product form and encodes the solution to the problem. We conjecture that such entangling problem Hamiltonians might evade the many-body localization bottleneck of the adiabatic quantum computation and thus improve its performance.

DOI
10.1134/s1995080222100262

Related papers

Non-diagonal problem Hamiltonian for adiabatic quantum computation

Oleg Valentinovich Lychkovskiy

Adiabatic quantum computation starts from embedding a computational problem into a Hamiltonian whose ground state encodes the solution to the problem. This problem Hamiltonian, $H_{\rm p}$, is normally chosen to be diagonal in the computational basis, which is a product basis for qubits. We point out that $H_{\rm p}$ can be chosen to be non-diagonal. To be more precise, we show how to construct $H_{\rm p}$ in such a way that all its excited states are entangled with respect to the qubit tensor product structure, while the ground state is still of the product form and encodes the solution to the problem. We discuss how such non-diagonal problem Hamiltonians might improve the performance of the adiabatic quantum computation.

•Nov 23, 2018•1 citation

An Alternative Approach to Construct the Initial Hamiltonian of the Adiabatic Quantum Computation

Qian-Heng Duan, Shuo Zhang, Wei Wu +1 more

The adiabatic quantum computation (AQC) has been proven to be equivalent to the standard circuit model. Conventionally, AQC evolves from the initial Hamiltonian which has a uniform equal superposition of the computational basis to the final Hamiltonian whose ground state encodes the solution to a computation problem. We propose an alternative approach to construct the initial Hamiltonian of the AQC which has an unequal superposition of the possible solutions to the problem and show that an educated guess can improve the performance of AQC.

Chinese Physics Letters•Jan 1, 2013•19 citations

Adiabatic quantum computation with spin ensembles

Naeimeh Mohseni, Marek Narożniak, Alexey N. Pyrkov +3 more

In the standard approach to adiabatic quantum computing (AQC), quantum information stored on qubits are adia- batically evolved to find the lowest energy state of a problem Hamiltonian. Here we investigate a variation of AQC where spin ensembles are used in place of qubits. The use of ensembles duplicates the quantum information, and allows errors to be suppressed during the adiabatic evolution. We show that there are two distinct types of problem Hamiltonians under this mapping, where the first excited state is a single particle perturbation on the ground state (Type I); or a macroscopically distinct fully polarized state (Type II). For Type I problems, we find that the minimum gap for large ensembles is well predicted by mean-field theory and the AQC performance improves with ensemble size, realizing error-suppression. For Type II problems, the performance of the AQC is mixed, and the gap can increase or decrease with ensemble size depending on the problem instance. The incidences of the Type II problems are greatly suppressed with ensemble size, and consequently for randomly chosen problem instances the success probability of the scheme improves with the ensemble size. Our approach shows that it is possible to perform AQC without the necessity of controlling individual qubits, which allows for an alternative route towards implementing AQC.

AIP conference proceedings•Jan 1, 2020•0 citations

Adiabatic Quantum Computing and Global Solution of NP-Hard QUBO Problems: A General Approach

Sanjay Sharma, Ravi Kumar

QUBO problems are NP-hard and have wide applications in optimization, including finance, logistics, machine learning, and combinatorial problems. However, classical algorithms employed for solving them can often get stuck in local minima. This paper presents an Adiabatic Quantum Computing (AQC) approach towards finding an optimal solution for QUBO problems. The QUBO problem has been first encoded into Hamiltonians. The adiabatic theorem has been used to achieve success of an AQC solution with a rate which is found to be dependent on relative gap between the ground state and first exited state of the Hamiltonian.

IEEE International Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI)•Mar 12, 2026•0 citations

Adiabatic quantum evolution for preparation of quantum entanglement states

Wen Jiayan, Qiu Daowen

Preparation of quantum entanglement states is crucial yet challenging to quantum communication and quantum computation. Recent studies have shown that the intermediate states of adiabatic Grover‘s algorithm are entanglement, although its initial and final states are product states. In light of this result, this paper presents a novel approach of preparing entanglement states based on adiabatic quantum evolution. Firstly, the desired entanglement states are encoded as the ground states of a final Hamiltonian, and the quantum system is started with an easily constructed ground state of an initial Hamiltonian. Secondly, the initial Hamiltonian adiabatically evolved to the final Hamiltonian. At the end of the evolution, the entangled states can be obtained with reasonably high probability. As a result, the whole preparation process of entanglement states looks like typical adiabatic quantum computation. The validation of the proposed approach has been made in the context of EPR and three-particle GHZ states, which show that the relevant entanglement states can be successfully prepared by adiabatic quantum evolution.

Chinese Control Conference (CCC)•Jul 1, 2008•0 citations

Error suppression in adiabatic quantum computing with qubit ensembles

Naeimeh Mohseni, Marek Narożniak, Alexey N. Pyrkov +3 more

Abstract Incorporating protection against quantum errors into adiabatic quantum computing (AQC) is an important task due to the inevitable presence of decoherence. Here, we investigate an error-protected encoding of the AQC Hamiltonian, where qubit ensembles are used in place of qubits. Our Hamiltonian only involves total spin operators of the ensembles, offering a simpler route towards error-corrected quantum computing. Our scheme is particularly suited to neutral atomic gases where it is possible to realize large ensemble sizes and produce ensemble-ensemble entanglement. We identify a critical ensemble size Nc where the nature of the first excited state becomes a single particle perturbation of the ground state, and the gap energy is predictable by mean-field theory. For ensemble sizes larger than Nc, the ground state becomes protected due to the presence of logically equivalent states and the AQC performance improves with N, as long as the decoherence rate is sufficiently low.

arXiv:1909.09947•npj Quantum Information•May 10, 2021•19 citations
Abstract Adiabatic quantum computation starts from embedding a computational problem into a Hamiltonian whose ground state encodes the solution to the problem. This problem Hamiltonian is normally chosen to be diagonal in the computational basis, that is a product basis for qubits. We demonstrate that, in fact, a problem Hamiltonian can always be chosen to be non-diagonal in the computational basis. To be more precise, we show how to construct a problem Hamiltonian in such a way that all its excited states are entangled with respect to the qubit tensor product structure, while the ground state is still of the product form and encodes the solution to the problem. We conjecture that such entangling problem Hamiltonians might evade the many-body localization bottleneck of the adiabatic quantum computation and thus improve its performance.
Adiabatic quantum computation starts from embedding a computational problem into a Hamiltonian whose ground state encodes the solution to the problem. This problem Hamiltonian, HpH_{\rm p}Hp​, is normally chosen to be diagonal in the computational basis, which is a product basis for qubits. We point out that HpH_{\rm p}Hp​ can be chosen to be non-diagonal. To be more precise, we show how to construct HpH_{\rm p}Hp​ in such a way that all its excited states are entangled with respect to the qubit tensor product structure, while the ground state is still of the product form and encodes the solution to the problem. We discuss how such non-diagonal problem Hamiltonians might improve the performance of the adiabatic quantum computation.
The adiabatic quantum computation (AQC) has been proven to be equivalent to the standard circuit model. Conventionally, AQC evolves from the initial Hamiltonian which has a uniform equal superposition of the computational basis to the final Hamiltonian whose ground state encodes the solution to a computation problem. We propose an alternative approach to construct the initial Hamiltonian of the AQC which has an unequal superposition of the possible solutions to the problem and show that an educated guess can improve the performance of AQC.
In the standard approach to adiabatic quantum computing (AQC), quantum information stored on qubits are adia- batically evolved to find the lowest energy state of a problem Hamiltonian. Here we investigate a variation of AQC where spin ensembles are used in place of qubits. The use of ensembles duplicates the quantum information, and allows errors to be suppressed during the adiabatic evolution. We show that there are two distinct types of problem Hamiltonians under this mapping, where the first excited state is a single particle perturbation on the ground state (Type I); or a macroscopically distinct fully polarized state (Type II). For Type I problems, we find that the minimum gap for large ensembles is well predicted by mean-field theory and the AQC performance improves with ensemble size, realizing error-suppression. For Type II problems, the performance of the AQC is mixed, and the gap can increase or decrease with ensemble size depending on the problem instance. The incidences of the Type II problems are greatly suppressed with ensemble size, and consequently for randomly chosen problem instances the success probability of the scheme improves with the ensemble size. Our approach shows that it is possible to perform AQC without the necessity of controlling individual qubits, which allows for an alternative route towards implementing AQC.
QUBO problems are NP-hard and have wide applications in optimization, including finance, logistics, machine learning, and combinatorial problems. However, classical algorithms employed for solving them can often get stuck in local minima. This paper presents an Adiabatic Quantum Computing (AQC) approach towards finding an optimal solution for QUBO problems. The QUBO problem has been first encoded into Hamiltonians. The adiabatic theorem has been used to achieve success of an AQC solution with a rate which is found to be dependent on relative gap between the ground state and first exited state of the Hamiltonian.
Preparation of quantum entanglement states is crucial yet challenging to quantum communication and quantum computation. Recent studies have shown that the intermediate states of adiabatic Grover‘s algorithm are entanglement, although its initial and final states are product states. In light of this result, this paper presents a novel approach of preparing entanglement states based on adiabatic quantum evolution. Firstly, the desired entanglement states are encoded as the ground states of a final Hamiltonian, and the quantum system is started with an easily constructed ground state of an initial Hamiltonian. Secondly, the initial Hamiltonian adiabatically evolved to the final Hamiltonian. At the end of the evolution, the entangled states can be obtained with reasonably high probability. As a result, the whole preparation process of entanglement states looks like typical adiabatic quantum computation. The validation of the proposed approach has been made in the context of EPR and three-particle GHZ states, which show that the relevant entanglement states can be successfully prepared by adiabatic quantum evolution.
Abstract Incorporating protection against quantum errors into adiabatic quantum computing (AQC) is an important task due to the inevitable presence of decoherence. Here, we investigate an error-protected encoding of the AQC Hamiltonian, where qubit ensembles are used in place of qubits. Our Hamiltonian only involves total spin operators of the ensembles, offering a simpler route towards error-corrected quantum computing. Our scheme is particularly suited to neutral atomic gases where it is possible to realize large ensemble sizes and produce ensemble-ensemble entanglement. We identify a critical ensemble size Nc where the nature of the first excited state becomes a single particle perturbation of the ground state, and the gap energy is predictable by mean-field theory. For ensemble sizes larger than Nc, the ground state becomes protected due to the presence of logically equivalent states and the AQC performance improves with N, as long as the decoherence rate is sufficiently low.