REVIEW 1 cited by
Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design
Not yet reviewed by Pith; the record is open.
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
read the original abstract
We introduce Yao, an extensible, efficient open-source framework for quantum algorithm design. Yao features generic and differentiable programming of quantum circuits. It achieves state-of-the-art performance in simulating small to intermediate-sized quantum circuits that are relevant to near-term applications. We introduce the design principles and critical techniques behind Yao. These include the quantum block intermediate representation of quantum circuits, a builtin automatic differentiation engine optimized for reversible computing, and batched quantum registers with GPU acceleration. The extensibility and efficiency of Yao help boost innovation in quantum algorithm design.
Forward citations
Cited by 1 Pith paper
-
Backpropagating Pauli Propagation
A backward-propagation algorithm computes gradients for sparse Pauli dynamics in O(1) passes and O(N_P) memory, with gradient accuracy empirically comparable to the simulation's own energy accuracy.
Discussion (0). Sign in to comment.