これは大事そう
Ah, another beautiful question in quantum complexity theory solved! This one is due to Scott Aaronson and @AAmbainis, about the necessity of structure in a problem for exponential quantum advantage. This question inspired a lot of research and we collectively learned a lot about quantum computing from it.
The problem seemed ripe; this year it felt like we were closing in on it. The most recent (human-written) papers on it had solved special cases showing that parallel quantum algorithms cannot achieve exponential speedups for unstructured problems.
What is the next beautiful question in quantum algorithms that will spur another generation of learning and understanding?
* Guy Blanc, Jordan Docter, Carmen Strassle and Li-Yang Tan, Quantum Speedups Require Structure or Depth (arxiv.org/abs/2608.19158)
* Qipeng Liu, Saachi Mutreja (my fantastic student!), Parallel Quantum Advantage with Limited Adaptivity Requires Structure (arxiv.org/abs/2608.20297)
19
I found it cool that the proof builds on the results of my PhD advisor, @JiapengZhang3, and my academic grandfather Shachar Lovett in 2023.
If this proof holds up, it is another nice reminder that classical techniques can be pretty important for understanding quantum questions.
Ah, another beautiful question in quantum complexity theory solved! This one is due to Scott Aaronson and @AAmbainis, about the necessity of structure in a problem for exponential quantum advantage. This question inspired a lot of research and we collectively learned a lot about quantum computing from it.
The problem seemed ripe; this year it felt like we were closing in on it. The most recent (human-written) papers on it had solved special cases showing that parallel quantum algorithms cannot achieve exponential speedups for unstructured problems.
What is the next beautiful question in quantum algorithms that will spur another generation of learning and understanding?
* Guy Blanc, Jordan Docter, Carmen Strassle and Li-Yang Tan, Quantum Speedups Require Structure or Depth (arxiv.org/abs/2608.19158)
* Qipeng Liu, Saachi Mutreja (my fantastic student!), Parallel Quantum Advantage with Limited Adaptivity Requires Structure (arxiv.org/abs/2608.20297)
1
16
1,809
I had also thought about this at some point, and I agree that it was ripe for the picking. I’m curious to see what the proof looks like.
P.S. Are we now going to say that the proof was found by physical superintelligence? :)
Ah, another beautiful question in quantum complexity theory solved! This one is due to Scott Aaronson and @AAmbainis, about the necessity of structure in a problem for exponential quantum advantage. This question inspired a lot of research and we collectively learned a lot about quantum computing from it.
The problem seemed ripe; this year it felt like we were closing in on it. The most recent (human-written) papers on it had solved special cases showing that parallel quantum algorithms cannot achieve exponential speedups for unstructured problems.
What is the next beautiful question in quantum algorithms that will spur another generation of learning and understanding?
* Guy Blanc, Jordan Docter, Carmen Strassle and Li-Yang Tan, Quantum Speedups Require Structure or Depth (arxiv.org/abs/2608.19158)
* Qipeng Liu, Saachi Mutreja (my fantastic student!), Parallel Quantum Advantage with Limited Adaptivity Requires Structure (arxiv.org/abs/2608.20297)
1
12
834
I’m hoping for another special lecture by @BooleanAnalysis explaining this proof…
Ah, another beautiful question in quantum complexity theory solved! This one is due to Scott Aaronson and @AAmbainis, about the necessity of structure in a problem for exponential quantum advantage. This question inspired a lot of research and we collectively learned a lot about quantum computing from it.
The problem seemed ripe; this year it felt like we were closing in on it. The most recent (human-written) papers on it had solved special cases showing that parallel quantum algorithms cannot achieve exponential speedups for unstructured problems.
What is the next beautiful question in quantum algorithms that will spur another generation of learning and understanding?
* Guy Blanc, Jordan Docter, Carmen Strassle and Li-Yang Tan, Quantum Speedups Require Structure or Depth (arxiv.org/abs/2608.19158)
* Qipeng Liu, Saachi Mutreja (my fantastic student!), Parallel Quantum Advantage with Limited Adaptivity Requires Structure (arxiv.org/abs/2608.20297)
Incredible! This is/was one of my favorite conjectures:
Ah, another beautiful question in quantum complexity theory solved! This one is due to Scott Aaronson and @AAmbainis, about the necessity of structure in a problem for exponential quantum advantage. This question inspired a lot of research and we collectively learned a lot about quantum computing from it.
The problem seemed ripe; this year it felt like we were closing in on it. The most recent (human-written) papers on it had solved special cases showing that parallel quantum algorithms cannot achieve exponential speedups for unstructured problems.
What is the next beautiful question in quantum algorithms that will spur another generation of learning and understanding?
* Guy Blanc, Jordan Docter, Carmen Strassle and Li-Yang Tan, Quantum Speedups Require Structure or Depth (arxiv.org/abs/2608.19158)
* Qipeng Liu, Saachi Mutreja (my fantastic student!), Parallel Quantum Advantage with Limited Adaptivity Requires Structure (arxiv.org/abs/2608.20297)