Pith. sign in

REVIEW 2 cited by

Quantum Complexity: restrictions on algorithms and architectures

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 1005.1425 v1 pith:IS3WJ6Q3 submitted 2010-05-09 cs.CC quant-ph

Daniel James Shepherd This is my paper · ORCID
classification cs.CCquant-ph
keywords accordancealgorithmsarchitecturesbristolcomplexitycomputerdegreedepartment
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

A dissertation submitted to the University of Bristol in accordance with the requirements of the degree of Doctor of Philosophy (PhD) in the Faculty of Engineering, Department of Computer Science, July 2009.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Fourier Spectrum of Noisy Quantum Algorithms

    quant-ph 2025-10 accept novelty 7.0 of 10

    Noisy quantum models DQC1 and 1/2BQP have provably smaller Fourier growth than BQP, giving N^Omega(1)-query lower bounds for 2- and 3-Forrelation in those models.

  2. Towards secondary structure prediction of longer mRNA sequences using a quantum-centric optimization scheme

    quant-ph 2025-05 conditional novelty 5.0 of 10

    Hybrid CVaR and IQP quantum workflows find CPLEX-verified optimal solutions for mRNA-folding QUBO instances up to 156 qubits, but simulated scaling shows steeply declining success rates.

Pith tools