Optimization of Quantum Circuit Mapping using Gate Transformation and Commutation

July 05, 2019 Β· Declared Dead Β· πŸ› Integr.

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Toshinari Itoko, Rudy Raymond, Takashi Imamichi, Atsushi Matsuo arXiv ID 1907.02686 Category quant-ph: Quantum Computing Cross-listed cs.DS, cs.ET Citations 117 Venue Integr. Last Checked 3 months ago
Abstract
This paper addresses quantum circuit mapping for Noisy Intermediate-Scale Quantum (NISQ) computers. Since NISQ computers constraint two-qubit operations on limited couplings, an input circuit must be transformed into an equivalent output circuit obeying the constraints. The transformation often requires additional gates that can affect the accuracy of running the circuit. Based upon a previous work of quantum circuit mapping that leverages gate commutation rules, this paper shows algorithms that utilize both transformation and commutation rules. Experiments on a standard benchmark dataset confirm the algorithms with more rules can find even better circuit mappings compared with the previously-known best algorithms.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

R.I.P. πŸ‘» Ghosted

Variational Quantum Algorithms

M. Cerezo, Andrew Arrasmith, ... (+9 more)

quant-ph πŸ› Nature Reviews Physics πŸ“š 3.3K cites 5 years ago

Died the same way β€” πŸ‘» Ghosted