Multi-strategy based quantum cost reduction of linear nearest-neighbor quantum circuit
From MaRDI portal
Publication:1746900
DOI10.1007/S11128-018-1832-YzbMath1386.81047OpenAlexW2786868874MaRDI QIDQ1746900
Xue-yun Cheng, Yang Liu, Zhi-jin Guan, Ying-Ying Tan, Hai-Ying Ma
Publication date: 26 April 2018
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-018-1832-y
Quantum computation (81P68) Analytic circuit theory (94C05) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (4)
Improving the implementation of quantum blockchain based on hypergraphs ⋮ Mathematical formulation of quantum circuit design problems in networks of quantum computers ⋮ Elementary quantum gates between long-distance qubits mediated by a resonator ⋮ Quantum circuit compilation for nearest-neighbor architecture based on reinforcement learning
Cites Work
- Synthesis of quantum circuits for linear nearest neighbor architectures
- Line ordering of reversible circuits for linear nearest neighbor realization
- Quantum Computation and Quantum Information
- Using $$\pi $$ DDs for Nearest Neighbor Optimization of Quantum Circuits
- A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis
- Logical Reversibility of Computation
This page was built for publication: Multi-strategy based quantum cost reduction of linear nearest-neighbor quantum circuit
