Optimal Quantum Circuits for Nearest-Neighbor Architectures
From MaRDI portal
Abstract: We show that the depth of quantum circuits in the realistic architecture where a classical controller determines which local interactions to apply on the kD grid Z^k where k >= 2 is the same (up to a constant factor) as in the standard model where arbitrary interactions are allowed. This allows minimum-depth circuits (up to a constant factor) for the nearest-neighbor architecture to be obtained from minimum-depth circuits in the standard abstract model. Our work therefore justifies the standard assumption that interactions can be performed between arbitrary pairs of qubits. In particular, our results imply that Shor's algorithm, controlled operations and fanouts can be implemented in constant depth, polynomial size and polynomial width in this architecture. We also present optimal non-adaptive quantum circuits for controlled operations and fanouts on a kD grid. These circuits have depth Theta(n^(1 / k)), size Theta(n) and width Theta(n). Our lower bound also applies to a more general class of operations.
Recommendations
- Design of efficient quantum circuits using nearest neighbor constraint in 2D architecture
- Synthesis of quantum circuits for linear nearest neighbor architectures
- An efficient conversion of quantum circuits to a linear nearest neighbor architecture
- Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures
- Asymptotically optimal circuits for arbitrary n-qubit diagonal computations
- Efficient quantum computing between remote qubits in linear nearest neighbor architectures
- Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective
- Using DDs for nearest neighbor optimization of quantum circuits
- Considering nearest neighbor constraints of quantum circuits at the reversible circuit level
- Efficient circuits for exact-universal computation with qudits
Cited in
(10)- Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective
- Exact global reordering for nearest neighbor quantum circuits using \({\mathrm {A}}^{*}\)
- Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures
- A nearest neighbor architecture to overcome dephasing
- Optimized quantum circuit partitioning
- Implementation of Shor's algorithm on a linear nearest neighbour qubit array
- Designing lattice structures with maximal nearest-neighbor entanglement
- scientific article; zbMATH DE number 7559364 (Why is no real title available?)
- Computation at a distance
- Improving quantum computation by optimized qubit routing
This page was built for publication: Optimal Quantum Circuits for Nearest-Neighbor Architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958433)
