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

Monograph series on nonlinear science and complexity

Chapter 24 Non-Hamiltonian Systems as Quantum Computers

Vasily Evgenevich Tarasov

Published Jan 1, 2008• 0 citations
Publisher
DOI
10.1016/s1574-6917(07)00024-4

Related papers

On non-Hermitian quantum mechanics.

Jared L. Peacock

The purpose of this dissertation is to review the salient features of non-Hermitian quantum mechanics. An introduction to Hermitian quantum mechanics is included to make this review as accessible as possible. Attempts at formulating a consistent physical theory are introduced, before examining non-Hermitian theories’ uses as convenient computational frameworks. Particular emphasis is placed on recent developments in open quantum systems that utilise non-Hermitian Hamiltonians. Chapter four introduces a logic that maps a non-Hermitian Hamiltonian onto a non-Hamiltonian algebra that has a Hermitian Hamiltonian. This was put forward by Sergi, who then goes on to show its application to a two level system. The time evolution is then derived in terms of the density matrix model. This system can then be used to analyse different types of decay such as coherence and population difference. This serves to illustrate the usefulness of the approach.

•Mar 19, 2014•1 citation

Hamiltonian Engineering for Quantum Systems

Sonia G. Schirmer

arXiv:quant-ph/0602014•Springer eBooks•Oct 5, 2007•6 citations

Operators, Eigenvalues and Eigenfunctions

S. Rajasekar, R. Velusamy

Operators in quantum mechanics which represent observables are of a special type: They are linear and Hermitian. Such operators not only form computation tools, but also form the most effective language in terms of which the theory can be formulated. This chapter presents important properties of linear operators and their eigenfunctions. It discusses the features of various operators which are necessary for studying quantum mechanical systems. The chapter shows how rich and beautiful the mathematical structure of quantum mechanics is. There exists a class of eigenvalue problems, the so-called parity-time reversal (PT) -symmetric non-Hermitian Hamiltonian problems. They have arisen in recent years in a number of physical contexts such as localization transitions, vortex pinning and population biology. Such non-Hermitian Hamiltonians can be used to describe certain experimental phenomena. PT-symmetry has been noticed in certain optical systems, such as optical couplers, microwave billiard and large-scale temporal lattices.

CRC Press eBooks•Sep 29, 2022•0 citations

Quantum Mechanical Hamiltonian Models of Computersa

Paul A. Benioff

Annals of the New York Academy of Sciences•Dec 1, 1986•40 citations

Lecture Notes on Quantum Algorithms

Muhammad Faryad

These notes begin in Chapter 1 with a review of linear algebra and the postulates of quantum mechanics, leading to an explanation of single- and multi-qubit gates. Chapter 2 explores the challenge of constructing arbitrary quantum states from given initial states, and introduces circuits for building oracles. Chapter 3 presents foundational algorithms such as entanglement creation, quantum teleportation, Deutsch-Jozsa, Bernstein-Vazirani, and Simon's algorithm. Chapters 4 and 5 cover algorithms based on the quantum Fourier transform, including phase estimation, period finding, factoring, and logarithm computation. These chapters also include complexity analysis and detailed quantum circuits suitable for implementation in code. Chapter 6 introduces Grover's algorithm for quantum search and amplitude amplification, including its realization via Hamiltonian simulation and a method for derandomization. Chapter 7 discusses basic techniques for Hamiltonian simulation, such as Lie-Trotter decomposition, sparse Hamiltonians, and the linear combination of unitaries. It also provides example circuits for simulating Hamiltonians expressed as linear combinations of Pauli operators. Chapter 8 introduces variational quantum algorithms, and Chapter 9 presents an algorithm for simulating fermionic many-particle systems, with an emphasis on molecular Hamiltonians. It also outlines the key transformations needed to map a molecular Hamiltonian to a form suitable for simulation on a quantum computer.

arXiv:2507.11565•Jul 14, 2025•0 citations

Quantum Computation and Quantum Systems

Chapman & Hall/CRC applied mathematics and nonlinear science series•Sep 18, 2006•1 citation
The purpose of this dissertation is to review the salient features of non-Hermitian quantum mechanics. An introduction to Hermitian quantum mechanics is included to make this review as accessible as possible. Attempts at formulating a consistent physical theory are introduced, before examining non-Hermitian theories’ uses as convenient computational frameworks. Particular emphasis is placed on recent developments in open quantum systems that utilise non-Hermitian Hamiltonians. Chapter four introduces a logic that maps a non-Hermitian Hamiltonian onto a non-Hamiltonian algebra that has a Hermitian Hamiltonian. This was put forward by Sergi, who then goes on to show its application to a two level system. The time evolution is then derived in terms of the density matrix model. This system can then be used to analyse different types of decay such as coherence and population difference. This serves to illustrate the usefulness of the approach.
Operators in quantum mechanics which represent observables are of a special type: They are linear and Hermitian. Such operators not only form computation tools, but also form the most effective language in terms of which the theory can be formulated. This chapter presents important properties of linear operators and their eigenfunctions. It discusses the features of various operators which are necessary for studying quantum mechanical systems. The chapter shows how rich and beautiful the mathematical structure of quantum mechanics is. There exists a class of eigenvalue problems, the so-called parity-time reversal (PT) -symmetric non-Hermitian Hamiltonian problems. They have arisen in recent years in a number of physical contexts such as localization transitions, vortex pinning and population biology. Such non-Hermitian Hamiltonians can be used to describe certain experimental phenomena. PT-symmetry has been noticed in certain optical systems, such as optical couplers, microwave billiard and large-scale temporal lattices.
These notes begin in Chapter 1 with a review of linear algebra and the postulates of quantum mechanics, leading to an explanation of single- and multi-qubit gates. Chapter 2 explores the challenge of constructing arbitrary quantum states from given initial states, and introduces circuits for building oracles. Chapter 3 presents foundational algorithms such as entanglement creation, quantum teleportation, Deutsch-Jozsa, Bernstein-Vazirani, and Simon's algorithm. Chapters 4 and 5 cover algorithms based on the quantum Fourier transform, including phase estimation, period finding, factoring, and logarithm computation. These chapters also include complexity analysis and detailed quantum circuits suitable for implementation in code. Chapter 6 introduces Grover's algorithm for quantum search and amplitude amplification, including its realization via Hamiltonian simulation and a method for derandomization. Chapter 7 discusses basic techniques for Hamiltonian simulation, such as Lie-Trotter decomposition, sparse Hamiltonians, and the linear combination of unitaries. It also provides example circuits for simulating Hamiltonians expressed as linear combinations of Pauli operators. Chapter 8 introduces variational quantum algorithms, and Chapter 9 presents an algorithm for simulating fermionic many-particle systems, with an emphasis on molecular Hamiltonians. It also outlines the key transformations needed to map a molecular Hamiltonian to a form suitable for simulation on a quantum computer.