Multi-strategy based quantum cost reduction of linear nearest-neighbor quantum circuit
DOI10.1007/S11128-018-1832-YzbMATH Open1386.81047OpenAlexW2786868874MaRDI QIDQ1746900FDOQ1746900
Ying-Ying Tan, Hai-Ying Ma, Xueyun Cheng, Yang Liu, Zhi-jin Guan
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
Recommendations
- Improving the quantum cost of NCT-based reversible circuit
- Cost optimization technique for quantum circuits
- Synthesis of quantum circuits for linear nearest neighbor architectures
- Mapping from multiple-control Toffoli circuits to linear nearest neighbor quantum circuits
- Design of efficient quantum circuits using nearest neighbor constraint in 2D architecture
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Quantum computation (81P68) Analytic circuit theory (94C05)
Cites Work
- Quantum Computation and Quantum Information
- Logical Reversibility of Computation
- Synthesis of quantum circuits for linear nearest neighbor architectures
- A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis
- Line ordering of reversible circuits for linear nearest neighbor realization
- Using $$\pi $$ DDs for Nearest Neighbor Optimization of Quantum Circuits
Cited In (5)
- Improving the implementation of quantum blockchain based on hypergraphs
- Quantum circuit compilation for nearest-neighbor architecture based on reinforcement learning
- Mathematical formulation of quantum circuit design problems in networks of quantum computers
- Elementary quantum gates between long-distance qubits mediated by a resonator
- Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective
This page was built for publication: Multi-strategy based quantum cost reduction of linear nearest-neighbor quantum circuit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746900)
