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...

Full description

Saved in:

Bibliographic Details
Published in:	Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design pp. 1 - 9
Main Authors:	Tan, Bochen, Cong, Jason
Format:	Conference Proceeding
Language:	English
Published:	Association on Computer Machinery 02.11.2020
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!