guest ::
| Home > Publications database > Simulation of a Quantum Annealer Based on Superconducting Flux Qubits |
| Home > Publications database > Simulation of a Quantum Annealer Based on Superconducting Flux Qubits |
| Poster (Other) | FZJ-2017-06911 |
; ; ; ;
2017
Please use a persistent id in citations: http://hdl.handle.net/2128/15645
Abstract: For quantum computers, there are two theoretical models which are nowadays considered to be the most important: the gate-based quantum computer and the quantum annealer.Gate-based quantum computers are based on computational gates just like classical computers are, but have potentially more computational power due to the algebra behind quantum theory. A quantum annealer works fundamentally different: First the system is prepared in a known ground state of an initial Hamiltonian, then this Hamiltonian is adiabatically transformed into the final Hamiltonian whose ground state corresponds to the solution of a given problem, usually taken from the class of optimization problems.Quantum annealing works well in theory if the qubits can be described by two-level systems. However, in real devices qubits are not based on a perfect two-level system, but on a two-dimensional subspace of a larger system. This makes approximations in analytic calculations unavoidable.With a simulation utilizing the Suzuki-Trotter product-formula approach for solving the time-dependent Schrödinger equation, the time-evolution of the full state of such a device based on superconducting flux qubits is investigated.
|
The record appears in these collections: |
PDF
Fulltext by OpenAccess repository