Name
Abstract | ||
|---|---|---|
Recent accomplishments in the development of quantum circuits motivated research in Computer-Aided Design for quantum circuits. Here, how to consider physical constraints in general and so-called nearest neighbor constraints in particular is an objective of recent developments. Re-ordering the given qubits in a circuit provides thereby a common strategy in order to reduce the corresponding costs. But since this leads to a significant complexity, existing solutions either worked towards a single order only (and, hence, exclude better options) or suffer from high runtimes when considering all possible options. In this work, we provide an alternative which utilizes so-called pi DDs for this purpose. They allow for the efficient representation and manipulation of sets of permutations and, hence, provide the ideal data-structure for the considered problem. Experimental evaluations confirm that, by utilizing pDDs, optimal or almost optimal results can be generated in a fraction of the time needed by exact solutions. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-40578-0_14 | REVERSIBLE COMPUTATION, RC 2016 |
Field | DocType | Volume |
k-nearest neighbors algorithm,Quantum,Topology,Computer science,Permutation,Theoretical computer science,Electronic circuit,Qubit | Conference | 9720 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.37 |
References | Authors | |
23 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert Wille | 1 | 1801 | 194.52 |
| Nils Quetschlich | 2 | 1 | 0.37 |
| Yuma Inoue | 3 | 3 | 2.44 |
| Norihito Yasuda | 4 | 3 | 1.78 |
| Shin-ichi Minato | 5 | 725 | 84.72 |