Integrated Synthesis of Linear Nearest Neighbor Ancilla-Free MCT Circuits

Rahman, Md. Mazder; Dueck, Gerhard W.; Chattopadhyay, Anupam; Wille, Robert

doi:10.1109/ismvl.2016.54

Cited by 19 publications

(10 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Shafaei et al [34] present a method that produces twodimensional circuits by modelling the problem as a Minimum Linear Arrangement (MinLA) problem. MinLA problems have been classified as NP-hard [30]. To reduce the input size, a circuit can be split into several sub-circuits solved independently and then combined.…”

Section: Related Workmentioning

confidence: 99%

A Multiobjective Approach for Nearest Neighbor Optimization of N-Dimensional Quantum Circuits

2021

View full text Add to dashboard Cite

The Nearest Neighbor (NN) restriction in quantum circuits requires quantum gates to act on geometrically adjacent qubits. Methods that convert generic quantum circuits and allow them to comply with the NN restriction have already been studied in the literature, where the main technique to accomplishing this task is by inserting SWAP gates into the circuit. In previous works, other authors have introduced a two-dimensional multi-objective NN conversion algorithm that takes into account two simultaneous objectives: the minimization of the two-dimensional grid size and the minimization of the number of SWAP gates required to allow any generic circuit to comply with the NN restriction. An extended higher-dimensional version of these previous methods is presented in this work, maintaining the same optimization objectives. We present experimental results for three-dimensional circuits, which show improvements for 52.6% of the tested circuits over all previously published results to date.

show abstract

Section: Related Workmentioning

confidence: 99%

A Multiobjective Approach for Nearest Neighbor Optimization of N-Dimensional Quantum Circuits

2021

View full text Add to dashboard Cite

show abstract

“…Due to long searching times, exact approaches are suitable for smaller circuits only. Works on LNN‐compliance were also presented in [18, 21–24].…”

Section: Related Workmentioning

confidence: 99%

Technique for two‐dimensional nearest neighbour realisation of quantum circuits using weighted look‐ahead

Chhangte

Chakrabarty

2020

IET Computers & Digital Techniques

View full text Add to dashboard Cite

“…State-of-the-art approaches (such as introduced in [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23]) employ swapping as well as bridging schemes to satisfy the coupling constraint for a given operation if required. While they are working reasonably well for smaller architectures, they lead to substantial additional costs when large distances in growing architectures have to be covered.…”

Section: Introductionmentioning

confidence: 99%

Exploiting Quantum Teleportation in Quantum Circuit Mapping

Hillmich¹,

Zulehner²,

Wille³

2020

Preprint

Self Cite

View full text Add to dashboard Cite

Quantum computers are constantly growing in their number of qubits, but continue to suffer from restrictions such as the limited pairs of qubits that may interact with each other. Thus far, this problem is addressed by mapping and moving qubits to suitable positions for the interaction (known as quantum circuit mapping). However, this movement requires additional gates to be incorporated into the circuit, whose number should be kept as small as possible since each gate increases the likelihood of errors and decoherence. State-of-the-art mapping methods utilize swapping and bridging to move the qubits along the static paths of the coupling map-solving this problem without exploiting all means the quantum domain has to offer. In this paper, we propose to additionally exploit quantum teleportation as a possible complementary method. Quantum teleportation conceptually allows to move the state of a qubit over arbitrary long distances with constant overhead-providing the potential of determining cheaper mappings. The potential is demonstrated by a case study on the IBM Q Tokyo architecture which already shows promising improvements. With the emergence of larger quantum computing architectures, quantum teleportation will become more effective in generating cheaper mappings.

show abstract

Integrated Synthesis of Linear Nearest Neighbor Ancilla-Free MCT Circuits

Cited by 19 publications

References 13 publications

A Multiobjective Approach for Nearest Neighbor Optimization of N-Dimensional Quantum Circuits

A Multiobjective Approach for Nearest Neighbor Optimization of N-Dimensional Quantum Circuits

Technique for two‐dimensional nearest neighbour realisation of quantum circuits using weighted look‐ahead

Exploiting Quantum Teleportation in Quantum Circuit Mapping

Contact Info

Product

Resources

About