Non-Hermitian quantum circuits with renormalization after fixed non-unitary gates are equivalent to PostBQP, which equals PP, in the uniform circuit model.
Quantum computing, postselection, and probabilistic polynomial-time
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2representative citing papers
Quadratic bosonic Hamiltonian simulation is BQP-complete for a broad class that includes classical oscillator networks and continuous-time quantum walks, but becomes PostBQP-hard when extended to more general quadratic interactions.
citing papers explorer
-
Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics
Non-Hermitian quantum circuits with renormalization after fixed non-unitary gates are equivalent to PostBQP, which equals PP, in the uniform circuit model.
-
Complexity of Quadratic Bosonic Hamiltonian Simulation: $\mathsf{BQP}$-Completeness and $\mathsf{PostBQP}$-Hardness
Quadratic bosonic Hamiltonian simulation is BQP-complete for a broad class that includes classical oscillator networks and continuous-time quantum walks, but becomes PostBQP-hard when extended to more general quadratic interactions.