Depth-optimized reversible circuit synthesis

Arabzadeh, Mona; Zamani, Morteza Saheb; Sedighi, Mehdi; Saeedi, Mehdi

doi:10.1007/s11128-012-0482-8

Cited by 14 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For specific quantum circuits, one can explore more efficient implementations [6-9, 11, 12]. Additionally, one may try to use local gates "during" a general synthesis [13] instead of trying to reduce SWAP gates by a post-process approach. Although this seems interesting, considering locality besides other important metrics during the synthesis can complicate the overall process significantly.…”

Section: Prior Workmentioning

confidence: 99%

“…Physical implementation of the quantum Fourier transformation (QFT) [6,7], Shor's factorization algorithm [8][9][10], quantum addition [11], quantum error correction [12], and general reversible circuits [13] for the LNN/2DSL architectures have been explored in the past. Worst-case synthesis cost of a general/Boolean unitary matrix under the nearest neighbor restriction has been discussed in [14][15][16][17].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Shafaei

Saeedi

Pedram

2013

Proceedings of the 50th Annual Design Automation Conference

Self Cite

104

View full text Add to dashboard Cite

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.

show abstract

Section: Prior Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

Shafaei

Saeedi

Pedram

2013

Proceedings of the 50th Annual Design Automation Conference

Self Cite

104

View full text Add to dashboard Cite

show abstract

“…[7][8][9][10][11]), the vast majority of design methods does not consider this metric. As an example in [7,11], a cycle representation was chosen and input cycles where partitioned into three subsets. Each subset is synthesized independently on a different set of ancillae in parallel.…”

Section: Introductionmentioning

confidence: 99%

Reducing the Depth of Quantum Circuits Using Additional Circuit Lines

Abdessaied

Wille

Soeken

et al. 2013

Reversible Computation

View full text Add to dashboard Cite

Abstract. The synthesis of Boolean functions, as they are found in many quantum algorithms, is usually conducted in two steps. First, the function is realized in terms of a reversible circuit followed by a mapping into a corresponding quantum realization. During this process, the number of lines and the quantum costs of the resulting circuits have mainly been considered as optimization objectives thus far. However, beyond that also the depth of a quantum circuit is vital. Although first synthesis approaches that consider depth have recently been introduced, the majority of design methods did not consider this metric. In this paper, we introduce an optimization approach aiming for the reduction of depth in the process of mapping a reversible circuit into a quantum circuit. For this purpose, we present an improved (local) mapping of single gates as well as a (global) optimization scheme considering the whole circuit. In both cases, we incorporate the idea of exploiting additional circuit lines which are used in order to split a chain of serial gates. Our optimization techniques enable a concurrent application of gates which significantly reduces the depth of the circuit. Experiments show that reductions of approx. 40% on average can be achieved when following this scheme.

show abstract

“…Some notable approaches to the minimization of incompletely specified reversible function include the cube sharing and reordering [7], [14], [17], adding ancilla bits [1], [12], [15], using Toffoli gates with mixed control bits [7], [13], [16], [20] and designing circuits using Fredkin and Peres gates [3], [19].…”

Section: Introductionmentioning

confidence: 99%

Minimizing Reversible Circuits in the 2n Scheme Using Two and Three Bits Patterns

Lukáč

Hawash

Kameyama

et al. 2014

2014 17th Euromicro Conference on Digital System Design

View full text Add to dashboard Cite

In this paper we present improvements to the cost of quantum circuits implemented with 2n-lines circuit implementation. The 2n-line circuit implementation is intended for the linear nearest neighbor quantum circuits and implements any quantum circuits in such manner that they can be directly mapped to quantum implementations. In this paper we propose a replacement strategy for 2-and 3-qubit patterns detected on the control lines. It is demonstrated that application of this strategy leads to a considerable reduction of circuit cost.

show abstract

Depth-optimized reversible circuit synthesis

Cited by 14 publications

References 18 publications

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

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

Reducing the Depth of Quantum Circuits Using Additional Circuit Lines

Minimizing Reversible Circuits in the 2n Scheme Using Two and Three Bits Patterns

Contact Info

Product

Resources

About