Timeline for What is the "equivalent" quantum computational complexity class of the classical class APX (or PTAS)?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 24 at 12:52 | vote | accept | Another User | ||
| May 23 at 12:47 | answer | added | Mark Spinelli | timeline score: 1 | |
| May 3 at 12:18 | comment | added | Mark Spinelli | Also, by analogy to MAX-3SAT-3 (which is an example given on Wikipedia) you could ask about some restricted local Hamiltonian problem where each qubit can only appear in a constant number of local terms? | |
| May 3 at 12:14 | comment | added | Mark Spinelli | I don’t know, but quantum algorithms outshine classical algorithms when we ask for precision up to additive error (and not multiplicative error) because there’s no sign problem… | |
| S May 3 at 9:38 | review | First questions | |||
| May 3 at 14:10 | |||||
| S May 3 at 9:38 | history | asked | Another User | CC BY-SA 4.0 |