Evidence map›Paper›PMID 34124689›Full record

ArticlePhysical review research2020

Entanglement bounds on the performance of quantum computing architectures.

Zachary Eldredge, Leo Zhou, Aniruddha Bapat, James R Garrison, Abhinav Deshpande, Frederic T Chong, Alexey V Gorshkov

Abstract read
In one paragraph

Article in Physical review research, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

7 authors.

Zachary EldredgeJoint Center for Quantum Information and Computer Science, NIST/University of Maryland, College Park, Maryland 20742, USA.ORCID 0000-0002-2487-3493
Leo ZhouDepartment of Physics, Harvard University, Cambridge, Massachusetts 02138, USA.ORCID 0000-0001-7598-8621
Aniruddha BapatJoint Center for Quantum Information and Computer Science, NIST/University of Maryland, College Park, Maryland 20742, USA.
James R GarrisonJoint Center for Quantum Information and Computer Science, NIST/University of Maryland, College Park, Maryland 20742, USA.ORCID 0000-0001-9328-1566
Abhinav DeshpandeJoint Center for Quantum Information and Computer Science, NIST/University of Maryland, College Park, Maryland 20742, USA.ORCID 0000-0002-6114-1830
Frederic T ChongDepartment of Computer Science, University of Chicago, Chicago, Illinois 60637, USA.
Alexey V GorshkovJoint Center for Quantum Information and Computer Science, NIST/University of Maryland, College Park, Maryland 20742, USA.

Funding

Intramural NIST DOC 9999-NIST
6 · The paper itself

Abstract

There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular connectivity graph's performance as a quantum architecture can be difficult. In this paper, we show that a quantity known as the isoperimetric number establishes a lower bound on the time required to create highly entangled states. This metric we propose counts resources based on the use of two-qubit unitary operations, while allowing for arbitrarily fast measurements and classical feedback. We use this metric to evaluate the hierarchical architecture proposed by A. Bapat

Identifiers

PMID34124689
PMCPMC8194250

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.