An O(n^3) algorithm builds quantum hashing and QFT circuits on cactus qubit graphs by solving the shortest non-simple 1-covering path problem in polynomial time.
Addition on a quantum computer
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
quant-ph 4verdicts
UNVERDICTED 4representative citing papers
Hybrid quantum-classical constant propagation reduces multi-qubit quantum operations by propagating constants between quantum and classical program states.
A fully quantum gradient-based edge detection algorithm using NEQR encoding, cyclic shifts for neighbor superpositions, direction-aware alignment, and a Quantum Partitioning Algorithm for in-place thresholding, with claimed resource optimizations.
A quantum circuit prepares approximate Gaussian states via single-qubit rotations followed by QFT, achieving high fidelity with optional angle pruning for O(n) gate cost.
citing papers explorer
-
Circuits of Quantum Hashing and Quantum Fourier Transform for a Cactus as a Qubit Connectivity Graph
An O(n^3) algorithm builds quantum hashing and QFT circuits on cactus qubit graphs by solving the shortest non-simple 1-covering path problem in polynomial time.
-
Automatic De-Quantization of Quantum Programs Using Constant Propagation
Hybrid quantum-classical constant propagation reduces multi-qubit quantum operations by propagating constants between quantum and classical program states.
-
A Fully Quantum Algorithm for Image Edge Detection
A fully quantum gradient-based edge detection algorithm using NEQR encoding, cyclic shifts for neighbor superpositions, direction-aware alignment, and a Quantum Partitioning Algorithm for in-place thresholding, with claimed resource optimizations.
-
Efficient Gaussian State Preparation in Quantum Circuits
A quantum circuit prepares approximate Gaussian states via single-qubit rotations followed by QFT, achieving high fidelity with optional angle pruning for O(n) gate cost.