001     838256
005     20210129231524.0
024 7 _ |a 2128/15645
|2 Handle
037 _ _ |a FZJ-2017-06911
041 _ _ |a English
100 1 _ |a Nocon, Madita
|0 P:(DE-Juel1)167543
|b 0
|e Corresponding author
|u fzj
111 2 _ |a Big ideas in quantum matter
|c Nijmegen
|d 2017-09-14 - 2017-09-15
|w The Netherlands
245 _ _ |a Simulation of a Quantum Annealer Based on Superconducting Flux Qubits
260 _ _ |c 2017
336 7 _ |a Conference Paper
|0 33
|2 EndNote
336 7 _ |a INPROCEEDINGS
|2 BibTeX
336 7 _ |a conferenceObject
|2 DRIVER
336 7 _ |a CONFERENCE_POSTER
|2 ORCID
336 7 _ |a Output Types/Conference Poster
|2 DataCite
336 7 _ |a Poster
|b poster
|m poster
|0 PUB:(DE-HGF)24
|s 1508476042_23795
|2 PUB:(DE-HGF)
|x Other
520 _ _ |a 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.
536 _ _ |a 511 - Computational Science and Mathematical Methods (POF3-511)
|0 G:(DE-HGF)POF3-511
|c POF3-511
|f POF III
|x 0
700 1 _ |a Willsch, Dennis
|0 P:(DE-Juel1)167542
|b 1
|u fzj
700 1 _ |a Jin, Fengping
|0 P:(DE-Juel1)144355
|b 2
|u fzj
700 1 _ |a De Raedt, Hans
|0 P:(DE-HGF)0
|b 3
700 1 _ |a Michielsen, Kristel
|0 P:(DE-Juel1)138295
|b 4
|u fzj
856 4 _ |y OpenAccess
|u https://juser.fz-juelich.de/record/838256/files/Poster%20Nijmegen%20Workshop.pdf
856 4 _ |y OpenAccess
|x icon
|u https://juser.fz-juelich.de/record/838256/files/Poster%20Nijmegen%20Workshop.gif?subformat=icon
856 4 _ |y OpenAccess
|x icon-1440
|u https://juser.fz-juelich.de/record/838256/files/Poster%20Nijmegen%20Workshop.jpg?subformat=icon-1440
856 4 _ |y OpenAccess
|x icon-180
|u https://juser.fz-juelich.de/record/838256/files/Poster%20Nijmegen%20Workshop.jpg?subformat=icon-180
856 4 _ |y OpenAccess
|x icon-640
|u https://juser.fz-juelich.de/record/838256/files/Poster%20Nijmegen%20Workshop.jpg?subformat=icon-640
909 C O |o oai:juser.fz-juelich.de:838256
|p openaire
|p open_access
|p VDB
|p driver
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 0
|6 P:(DE-Juel1)167543
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 1
|6 P:(DE-Juel1)167542
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 2
|6 P:(DE-Juel1)144355
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 4
|6 P:(DE-Juel1)138295
913 1 _ |a DE-HGF
|b Key Technologies
|1 G:(DE-HGF)POF3-510
|0 G:(DE-HGF)POF3-511
|2 G:(DE-HGF)POF3-500
|v Computational Science and Mathematical Methods
|x 0
|4 G:(DE-HGF)POF
|3 G:(DE-HGF)POF3
|l Supercomputing & Big Data
914 1 _ |y 2017
915 _ _ |a OpenAccess
|0 StatID:(DE-HGF)0510
|2 StatID
920 _ _ |l yes
920 1 _ |0 I:(DE-Juel1)JSC-20090406
|k JSC
|l Jülich Supercomputing Center
|x 0
980 _ _ |a poster
980 _ _ |a VDB
980 _ _ |a UNRESTRICTED
980 _ _ |a I:(DE-Juel1)JSC-20090406
980 1 _ |a FullTexts


LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21