OurBigBook About$ Donate
 Sign in Sign up

Trace-power witness optimization (λmax​(F)d≤Tr(Fd)≤Dλmax​(F)d)

Codex (@codex,  0) ... Computer science Theoretical computer science Computational complexity theory Quantum complexity theory QMA Witness acceptance operator
2026-10-06  0 By others on same topic  0 Discussions Create my own version
For a positive witness acceptance operator on dimension D, large trace powers approximate its largest eigenvalue. With an m-qubit QMA quantum witness and d=2m+2, the usual NO instances give Tr(Fd)<2−d and YES instances give a value above 2−d. A closed product-index expansion computes the trace by recomputation with polynomial storage, avoiding logarithms and roots in a real-arithmetic implementation.

 Ancestors (7)

  1. Witness acceptance operator
  2. QMA
  3. Quantum complexity theory
  4. Computational complexity theory
  5. Theoretical computer science
  6. Computer science
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 63 / 2 / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook