Hauptseite > Publikationsdatenbank > Quantum Annealers and Partial Differential Equations: The Gate-Based Encoding Approach > print

001     1037283
005     20250203103212.0
037 _ _ |a FZJ-2025-00611
100 1 _ |a Sensebat, Orkun
|0 P:(DE-Juel1)195826
|b 0
|e Corresponding author
|u fzj
111 2 _ |a ISC High Performance 2024
|g ISC24
|c Hamburg
|d 2024-05-12 - 2024-05-16
|w Germany
245 _ _ |a Quantum Annealers and Partial Differential Equations: The Gate-Based Encoding Approach
260 _ _ |c 2024
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 1736926949_26707
|2 PUB:(DE-HGF)
|x After Call
520 _ _ |a Representing Partial Differential Equations (PDEs) on Quantum Annealers (QAs) is not obvious. The first step of solving a PDE on a QA is to discretize it. We used finite differences. Next, a Quadratic Unconstrained Binary Optimization (QUBO) model is obtained that is equivalent to an Ising model. Finally, the QUBO coefficients are computed using an encoding in terms of the qubits to represent the variables. The conventional choice for this encoding is a binary encoding. A challenge is that the accessible size of systems is constrained due to the limited number of qubits. In other words, it becomes impossible to achieve a non-zero convergence probability. We addressed this challenge by developing a novel encoding, the gate-based encoding (GBE), to replace the conventionally used binary encoding. This aims to overcome the problem of exponentially scaling coefficients of binary encoding. GBE utilizes the structure of the discretized operators to construct a circuit that results in QUBO weights of comparative magnitude for each bit in the final bit-string, thus overcoming the exponentially rising weight given to the leading digits in the conventionally used binary encoding. GBE allows to successfully solve problems with larger encoding lenths for all problem sizes and solvers, e.g., 21 vs. 17 for the hybrid solver with our test setup. This is also emphasized by the significantly higher success probability for all encoding lengths compared to binary encoding. The cost of GBE is the higher number of variables
536 _ _ |a 5111 - Domain-Specific Simulation & Data Life Cycle Labs (SDLs) and Research Groups (POF4-511)
|0 G:(DE-HGF)POF4-5111
|c POF4-511
|f POF IV
|x 0
700 1 _ |a Willsch, Dennis
|0 P:(DE-Juel1)167542
|b 1
|u fzj
700 1 _ |a Bode, Mathis
|0 P:(DE-Juel1)192255
|b 2
|u fzj
700 1 _ |a Michielsen, Kristel
|0 P:(DE-Juel1)138295
|b 3
|u fzj
856 4 _ |u https://app.swapcard.com/widget/event/isc-high-performance-2024/planning/UGxhbm5pbmdfMTgzOTk4OQ==
909 C O |o oai:juser.fz-juelich.de:1037283
|p VDB
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 0
|6 P:(DE-Juel1)195826
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)192255
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 3
|6 P:(DE-Juel1)138295
913 1 _ |a DE-HGF
|b Key Technologies
|l Engineering Digital Futures – Supercomputing, Data Management and Information Security for Knowledge and Action
|1 G:(DE-HGF)POF4-510
|0 G:(DE-HGF)POF4-511
|3 G:(DE-HGF)POF4
|2 G:(DE-HGF)POF4-500
|4 G:(DE-HGF)POF
|v Enabling Computational- & Data-Intensive Science and Engineering
|9 G:(DE-HGF)POF4-5111
|x 0
914 1 _ |y 2024
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 I:(DE-Juel1)JSC-20090406
980 _ _ |a UNRESTRICTED

LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21