Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource, 1 online resource.
- Sprache
-
Englisch
- Erschienen in
-
Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates ; volume:401 ; number:2 ; day:4 ; month:5 ; year:2023 ; pages:1531-1626 ; date:7.2023
Communications in mathematical physics ; 401, Heft 2 (4.5.2023), 1531-1626, 7.2023
- Urheber
-
Harrow, Aram W.
Mehraban, Saeed
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00220-023-04675-z
- URN
-
urn:nbn:de:101:1-2023092911325784832732
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:59 MESZ
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
- Harrow, Aram W.
- Mehraban, Saeed
- SpringerLink (Online service)
Ähnliche Objekte (12)
Quantization to speedup approximate nearest neighbor search
Föderierte Nearest-Neighbor-Queries
OPRCP: approximate nearest neighbor binary search algorithm for hybrid data over WMSN blockchain
The double-well Bose Hubbard model with nearest-neighbor and cavitymediated long-range interactions
Robust and efficient single-cell Hi-C clustering with approximate k-nearest neighbor graphs
Bias in nearest-neighbor hazard estimation
Bias in nearest-neighbor hazard estimation
Approximate Nearest Neighbor for Curves --- Simple, Efficient, and Deterministic: Q/A Session A - Paper A1.E
On the risk of nearest neighbor rules
Nearest neighbor imputation algorithms: a critical evaluation
Kinetic Models for Topological Nearest-Neighbor Interactions
Optimized Nearest-Neighbor Classifiers Using Generated Instances
Quantization to speedup approximate nearest neighbor search
Föderierte Nearest-Neighbor-Queries
OPRCP: approximate nearest neighbor binary search algorithm for hybrid data over WMSN blockchain
The double-well Bose Hubbard model with nearest-neighbor and cavitymediated long-range interactions
Robust and efficient single-cell Hi-C clustering with approximate k-nearest neighbor graphs
Bias in nearest-neighbor hazard estimation
Bias in nearest-neighbor hazard estimation
Approximate Nearest Neighbor for Curves --- Simple, Efficient, and Deterministic: Q/A Session A - Paper A1.E
On the risk of nearest neighbor rules
Nearest neighbor imputation algorithms: a critical evaluation
Kinetic Models for Topological Nearest-Neighbor Interactions
Optimized Nearest-Neighbor Classifiers Using Generated Instances
Quantization to speedup approximate nearest neighbor search
Föderierte Nearest-Neighbor-Queries
OPRCP: approximate nearest neighbor binary search algorithm for hybrid data over WMSN blockchain
The double-well Bose Hubbard model with nearest-neighbor and cavitymediated long-range interactions
Robust and efficient single-cell Hi-C clustering with approximate k-nearest neighbor graphs
Bias in nearest-neighbor hazard estimation
Bias in nearest-neighbor hazard estimation
Approximate Nearest Neighbor for Curves --- Simple, Efficient, and Deterministic: Q/A Session A - Paper A1.E
On the risk of nearest neighbor rules
Nearest neighbor imputation algorithms: a critical evaluation
Kinetic Models for Topological Nearest-Neighbor Interactions