Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures

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

Full description

Saved in:
Bibliographic Details
Published in2013 50th ACM/EDAC/IEEE Design Automation Conference (DAC) pp. 1 - 6
Main Authors Shafaei, Alireza, Saeedi, Mehdi, Pedram, Massoud
Format Conference Proceeding
LanguageEnglish
Published New York, NY, USA ACM 29.05.2013
IEEE
SeriesACM Conferences
Subjects
Benchmark testing
Computer architecture
Hardware > Electronic design automation > High-level and register-transfer level synthesis
interaction distance
Layout
Logic gates
Logic synthesis
Optimization
quantum architectures
quantum circuits
Quantum computing
Wires
logic synthesis
quantum architectures
quantum circuits
interaction distance
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:1450320716
9781450320719
ISSN:0738-100X
DOI:10.1145/2463209.2488785