Showing quant-phShow all
2 papers · 1 filter
quant-ph2025
Quantum Feasibility Labeling for NP-complete Vertex Coloring Problem
Junpeng Zhan
Many important science and engineering problems can be converted into NP-complete problems which are of significant importance in computer science and mathematics. Currently, neith…
quant-ph2024
Quantum Multiplier Based on Exponent Adder
Junpeng Zhan
Quantum multiplication is a fundamental operation in quantum computing. It is important to have a quantum multiplier with low complexity. In this paper, we propose the Quantum Mult…