REVIEW 1 cited by
Demonstrating NISQ Era Challenges in Algorithm Design on IBM's 20 Qubit Quantum Computer
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
Signed reviews
abstract
As superconducting qubits continue to advance technologically, the realization of quantum algorithms from theoretical abstraction to physical implementation requires knowledge of both quantum circuit construction as well as hardware limitations. In this study we present results from experiments run on IBM's 20-qubit `Poughkeepsie' architecture, with the goal of demonstrating various qubit qualities and challenges that arise in designing quantum algorithms. These include experimentally measuring $T_1$ and $T_2$ coherence times, gate fidelities, sequential CNOT gates, techniques for handling ancilla qubits, and finally CCNOT and QFT$^{\dagger}$ circuits implemented on several different qubit geometries. Our results demonstrate various techniques for improving quantum circuits which must compensate for limited connectivity, either through the use of SWAP gates or additional ancilla qubits.
Forward citations
Cited by 1 Pith paper
-
Simulating Quantum Algorithms Using Fidelity and Coherence Time as Principle Models for Error
The simulated breakpoints for 90 percent average success are about 99 to 99.9 percent gate fidelity for short circuits and above 99.99 percent for Grover, with coherence times of 50 to 500 microseconds.
Discussion (0). Continue with ORCID to comment.