Shor's algorithm generates and consumes magic resources in direct proportion to the difficulty of the underlying factoring problem.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Closed-form formula computes non-local magic for fermionic Gaussian states from two-point correlations in polynomial time.
citing papers explorer
-
The true cost of factoring: Linking magic and number-theoretic complexity in Shor's algorithm
Shor's algorithm generates and consumes magic resources in direct proportion to the difficulty of the underlying factoring problem.
-
Non-Local Magic Resources for Fermionic Gaussian States
Closed-form formula computes non-local magic for fermionic Gaussian states from two-point correlations in polynomial time.