Pith. sign in

REVIEW 1 cited by

5 Year Update to the Next Steps in Quantum Computing

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.08780 v1 pith:JJM4OSCM submitted 2024-01-26 cs.ET quant-ph

Kenneth Brown , Fred Chong , Kaitlin N. Smith , Tom Conte , Austin Adams , Aniket Dalvi , Christopher Kang , Josh Viszlai This is my paper · ORCID
classification cs.ETquant-ph
keywords quantumcomputingmachinesbeendonenextstepswhat
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

It has been 5 years since the Computing Community Consortium (CCC) Workshop on Next Steps in Quantum Computing, and significant progress has been made in closing the gap between useful quantum algorithms and quantum hardware. Yet much remains to be done, in particular in terms of mitigating errors and moving towards error-corrected machines. As we begin to transition from the Noisy-Intermediate Scale Quantum (NISQ) era to a future of fault-tolerant machines, now is an opportune time to reflect on how to apply what we have learned thus far and what research needs to be done to realize computational advantage with quantum machines.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimal Distributed Similarity Estimation of Quantum Channels

    quant-ph 2025-12 reject novelty 5.0 of 10

    Settling DSEC at Θ(max{√d/ε,1/ε²}) is claimed, but the general-channel protocol's unbiasedness proof uses a false identity, and explicit non-unital channels break the estimator.

Pith tools