Communication Trade Offs in Intermediate Qudit Circuits
arXiv:2211.16469 · doi:10.1109/ISMVL52857.2022.00014
Abstract
Quantum computing promises speedup of classical algorithms in the long term. Current hardware is unable to support this goal and programs must be efficiently compiled to use of the devices through reduction of qubits used, gate count and circuit duration. Many quantum systems have access to higher levels, expanding the computational space for a device. We develop higher level qudit communication circuits, compilation pipelines, and circuits that take advantage of this extra space by temporarily pushing qudits into these higher levels. We show how these methods are able to more efficiently use the device, and where they see diminishing returns.
arXiv comment7 pages, 9 Figures, In ISVML22: 2022 IEEE 52nd International Symposium on Multiple-Valued Logic
References in corpus (14)
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- A Quantum Engineer's Guide to Superconducting Qubits
- A Quantum Approximate Optimization Algorithm
- Benchmarking an 11-qubit quantum computer
- Qudits and high-dimensional quantum computing
- Multi-valued Logic Gates for Quantum Computation
- Concrete Categorical Model of a Quantum Circuit Description Language with Measurement
- Efficient preparation and detection of microwave dressed-state qubits and qutrits with trapped ions
- Two-step approach to scheduling quantum circuits
- Elementary gates for ternary quantum logic circuit
- Discrete Adjoints for Accurate Numerical Optimization with Application to Quantum Control
- Optimal Control of Closed Quantum Systems via B-Splines with Carrier Waves
- Decomposing Quantum Generalized Toffoli with an Arbitrary Number of Ancilla