A polynomial-time classical decision algorithm exactly characterizes which multivariable Laurent polynomial pairs are realizable by M-QSP and supplies a constructive implementation when the answer is yes.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
A parallel-in-time encoding turns quantum dynamical propagators into QUBO instances for direct benchmarking of quantum annealers against classical solvers on models from single-qubit rotations to PT-symmetric systems.
Authors propose implementing the non-unitary Jastrow-Gutzwiller operator via cascaded VQE on quantum hardware and demonstrate it for the Hubbard model on IBM Q Lagos.
citing papers explorer
-
Polynomial time constructive decision algorithm for multivariable quantum signal processing
A polynomial-time classical decision algorithm exactly characterizes which multivariable Laurent polynomial pairs are realizable by M-QSP and supplies a constructive implementation when the answer is yes.
-
Quantum-inspired dynamical models on quantum and classical annealers
A parallel-in-time encoding turns quantum dynamical propagators into QUBO instances for direct benchmarking of quantum annealers against classical solvers on models from single-qubit rotations to PT-symmetric systems.
-
Implementing Jastrow--Gutzwiller operators on a quantum computer using the cascaded variational quantum eigensolver algorithm
Authors propose implementing the non-unitary Jastrow-Gutzwiller operator via cascaded VQE on quantum hardware and demonstrate it for the Hubbard model on IBM Q Lagos.