Quantum annealing and its variants: Application to quadratic unconstrained binary optimization
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1868-8489
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Vom Verlag als Druckwerk on demand und/oder als E-Book angeboten
- Erschienen in
-
IAS Series ; 59
- Ereignis
-
Veröffentlichung
- (wo)
-
Jülich
- (wer)
-
Forschungszentrum Jülich GmbH, Zentralbibliothek
- (wann)
-
2024
- Urheber
- URN
-
urn:nbn:de:0001-20241209125135062-9549579-4
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
13.11.2025, 03:23 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Mehta, Vrinda
- Forschungszentrum Jülich GmbH, Zentralbibliothek
Entstanden
- 2024
Ähnliche Objekte (12)
Quantum annealing and its variants: application to quadratic unconstrained binary optimization
Rydberg‐Atom Graphs for Quadratic Unconstrained Binary Optimization Problems
On the hardness of quadratic unconstrained binary optimization problems
On some features of quadratic unconstrained binary optimization with random coefficients
Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing
Unconstrained binary models of the travelling salesman problem variants for quantum optimization
Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization
Solving unconstrained binary polynomial programs with limited reach : Application to low autocorrelation binary sequences
Probing quadratic gravity with binary inspirals
Binary defocusing technique based on complementary decoding with unconstrained dual projectors
Notes on automorphs of binary quadratic forms.
Paper XV. On Complex Binary Quadratic Forms.
Quantum annealing and its variants: application to quadratic unconstrained binary optimization
Rydberg‐Atom Graphs for Quadratic Unconstrained Binary Optimization Problems
On the hardness of quadratic unconstrained binary optimization problems
On some features of quadratic unconstrained binary optimization with random coefficients
Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing
Unconstrained binary models of the travelling salesman problem variants for quantum optimization
Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization
Solving unconstrained binary polynomial programs with limited reach : Application to low autocorrelation binary sequences
Probing quadratic gravity with binary inspirals
Binary defocusing technique based on complementary decoding with unconstrained dual projectors
Notes on automorphs of binary quadratic forms.
Paper XV. On Complex Binary Quadratic Forms.
Quantum annealing and its variants: application to quadratic unconstrained binary optimization
Rydberg‐Atom Graphs for Quadratic Unconstrained Binary Optimization Problems
On the hardness of quadratic unconstrained binary optimization problems
On some features of quadratic unconstrained binary optimization with random coefficients
Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing
Unconstrained binary models of the travelling salesman problem variants for quantum optimization
Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization
Solving unconstrained binary polynomial programs with limited reach : Application to low autocorrelation binary sequences
Probing quadratic gravity with binary inspirals
Binary defocusing technique based on complementary decoding with unconstrained dual projectors
Notes on automorphs of binary quadratic forms.