DocumentCode :
619489
Title :
Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures
Author :
Shafaei, Alireza ; Saeedi, Mehdi ; Pedram, Massoud
Author_Institution :
Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA
fYear :
2013
fDate :
May 29 2013-June 7 2013
Firstpage :
1
Lastpage :
6
Abstract :
Optimization of the interaction distance between qubits to map a quantum circuit into one-dimensional quantum architectures is addressed. The problem is formulated as the Minimum Linear Arrangement (MinLA) problem. To achieve this, an interaction graph is constructed for a given circuit, and multiple instances of the MinLA problem for selected subcircuits of the initial circuit are formulated and solved. In addition, a lookahead technique is applied to improve the cost of the proposed solution which examines different subcircuit candidates. Experiments on quantum circuits for quantum Fourier transform and reversible benchmarks show the effectiveness of the approach.
Keywords :
Fourier transforms; circuit optimisation; logic design; logic simulation; linear nearest neighbor architectures; minimum linear arrangement problem; one-dimensional quantum architectures; quantum Fourier transform; quantum circuits optimization; Benchmark testing; Computer architecture; Layout; Logic gates; Optimization; Quantum computing; Wires; Logic synthesis; interaction distance; quantum architectures; quantum circuits;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation Conference (DAC), 2013 50th ACM/EDAC/IEEE
Conference_Location :
Austin, TX
ISSN :
0738-100X
Type :
conf
Filename :
6560634
Link To Document :
بازگشت