REVIEW 1 cited by
Phase polynomials synthesis algorithms for NISQ architectures and beyond
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 present a framework for the synthesis of phase polynomials that addresses both cases of full connectivity and partial connectivity for NISQ architectures. In most cases, our algorithms generate circuits with lower CNOT count and CNOT depth than the state of the art or have a significantly smaller running time for similar performances. We also provide methods that can be applied to our algorithms in order to trade an increase in the CNOT count for a decrease in execution time, thereby filling the gap between our algorithms and faster ones.
Forward citations
Cited by 1 Pith paper
-
Encoding Choices and Fault-Tolerant Resource Estimates for Digital Quantum Hamiltonian Descent
For digital quantum Hamiltonian descent, binary amplitude encoding uses O(d log N) qubits and fewer R_z rotations than one-hot encoding in all tested benchmarks, making it the preferred starting point for fault-tolera...
Discussion (0). Continue with ORCID to comment.