- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2056-6387
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Resource-efficient verification of quantum computing using Serfling’s bound ; volume:5 ; number:1 ; day:12 ; month:4 ; year:2019 ; pages:1-8 ; date:12.2019
npj Quantum information ; 5, Heft 1 (12.4.2019), 1-8, 12.2019
- Urheber
-
Takeuchi, Yuki
Mantri, Atul
Morimae, Tomoyuki
Mizutani, Akihiro
Fitzsimons, Joseph F.
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1038/s41534-019-0142-2
- URN
-
urn:nbn:de:101:1-2019042721285628790383
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 14.08.2025, 10:54 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek.
Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Takeuchi, Yuki
- Mantri, Atul
- Morimae, Tomoyuki
- Mizutani, Akihiro
- Fitzsimons, Joseph F.
- SpringerLink (Online service)
Ähnliche Objekte (12)
Resource-efficient cryptography for ubiquitous computing
Resource-efficient photonic networks for next-generation AI computing
Blockchain-enabled verification of medical records using soul-bound tokens and cloud computing
Resource Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems
QRAS: efficient resource allocation for task scheduling in cloud computing
Energy efficient temporal load aware resource allocation in cloud computing datacenters
Risk Bounds for Reservoir Computing
Efficient verification of quantum resources
Correction to: Energy efficient temporal load aware resource allocation in cloud computing datacenters
Computing efficient data summaries
Frequency computations under certain resource bounds
Towards efficient verification of population protocols
Resource-efficient cryptography for ubiquitous computing
Resource-efficient photonic networks for next-generation AI computing
Blockchain-enabled verification of medical records using soul-bound tokens and cloud computing
Resource Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems
QRAS: efficient resource allocation for task scheduling in cloud computing
Energy efficient temporal load aware resource allocation in cloud computing datacenters
Risk Bounds for Reservoir Computing
Efficient verification of quantum resources
Correction to: Energy efficient temporal load aware resource allocation in cloud computing datacenters
Computing efficient data summaries
Frequency computations under certain resource bounds
Towards efficient verification of population protocols
Resource-efficient cryptography for ubiquitous computing
Resource-efficient photonic networks for next-generation AI computing
Blockchain-enabled verification of medical records using soul-bound tokens and cloud computing
Resource Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems
QRAS: efficient resource allocation for task scheduling in cloud computing
Energy efficient temporal load aware resource allocation in cloud computing datacenters
Risk Bounds for Reservoir Computing
Efficient verification of quantum resources
Correction to: Energy efficient temporal load aware resource allocation in cloud computing datacenters
Computing efficient data summaries
Frequency computations under certain resource bounds