QCPP implements polynomial transformations of Hamiltonians via stochastic mixtures of unitary channels, achieving a tunable tradeoff between query and sample complexity.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
quant-ph 4years
2026 4representative citing papers
A witness-based framework quantifies continuous-variable resources and activates them into discrete-variable entanglement or EPR steering via measure-and-prepare channels that produce Werner states.
Quantum integer multiplier with O(log^2 n) circuit depth and T-depth via parallel partial products and binary adder tree in the Clifford+T model.
A compilation scheme called Parity Twine achieved a 50-qubit unitary QFT with process fidelity ≈1e-2 on IBM Heron r3, and up to 52 qubits with plurality voting, surpassing prior unitary QFT demonstrations.
citing papers explorer
-
Quantum Channel Polynomial Processing
QCPP implements polynomial transformations of Hamiltonians via stochastic mixtures of unitary channels, achieving a tunable tradeoff between query and sample complexity.
-
Activating entanglement and EPR steering from continuous-variable resources using witness-based measures
A witness-based framework quantifies continuous-variable resources and activates them into discrete-variable entanglement or EPR steering via measure-and-prepare channels that produce Werner states.
-
A Polylogarithmic-Depth Quantum Multiplier
Quantum integer multiplier with O(log^2 n) circuit depth and T-depth via parallel partial products and binary adder tree in the Clifford+T model.
-
Demonstrating Record Fidelity for the Quantum Fourier Transform
A compilation scheme called Parity Twine achieved a 50-qubit unitary QFT with process fidelity ≈1e-2 on IBM Heron r3, and up to 52 qubits with plurality voting, surpassing prior unitary QFT demonstrations.