- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Tight Lieb–Robinson Bound for approximation ratio in quantum annealing ; volume:10 ; number:1 ; day:17 ; month:4 ; year:2024 ; pages:1-9 ; date:12.2024
npj Quantum information ; 10, Heft 1 (17.4.2024), 1-9, 12.2024
- Creator
-
Braida, Arthur
Martiel, Simon
Todinca, Ioan
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1038/s41534-024-00832-x
- URN
-
urn:nbn:de:101:1-2406292101018.848328543101
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:55 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Braida, Arthur
- Martiel, Simon
- Todinca, Ioan
- SpringerLink (Online service)
Other Objects (12)
Tight(er) bounds for similarity measures, smoothed approximation and broadcasting
Finite time bounds for Simulated Annealing
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
A tight lower bound for semi-synchronous collaborative grid exploration
Tight(er) bounds for similarity measures, smoothed approximation and broadcasting
Finite time bounds for Simulated Annealing
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
A tight lower bound for semi-synchronous collaborative grid exploration
Tight(er) bounds for similarity measures, smoothed approximation and broadcasting
Finite time bounds for Simulated Annealing
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence