Optimal Layout Synthesis for Quantum Computing

Recent years have witnessed the fast development of quantum computing. Researchers around the world are eager to run larger and larger quantum algorithms that promise speedups impossible to any classical algorithm. However, the available quantum computers are still volatile and error-prone. Thus, la...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design s. 1 - 9
Hlavní autori:	Tan, Bochen, Cong, Jason
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Association on Computer Machinery 02.11.2020
Predmet:	allocation approximate synthesizer available quantum computers computational complexity Computer architecture Couplings larger quantum algorithms larger solution space Layout layout synthesis layout synthesis problem leading optimal approaches Logic gates mapping mathematical programming mathematical programming problem near-term quantum computers optimal layout synthesis optimal synthesizer optimisation placement quantum computing quantum programs Qubit scheduling Synthesizers
ISSN:	1558-2434
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!