LAB LOGA page on LabLog, a review site (not the lab's official page)
Quantum Information Theory, Theoretical Computer Science, and Algorithms Lab
Machine-translated · View original
A research group that uses mathematics to explore quantum computer algorithms and computational complexity.
AboutAbout the lab
Studying quantum algorithms and complexity theory.
The Quantum Algorithms and Complexity Theory Group studies quantum algorithms and quantum computational complexity theory.
Its goal is to discover new quantum algorithms and find killer applications for quantum computers.
The group also works on theoretically proving the advantage of quantum algorithms using mathematical methods.
The graduation research seminar of the Department of Mathematics requires neither programming experience nor prior knowledge of quantum mechanics.
Key terms
- Quantum algorithm
- A procedure for solving a problem on a quantum computer. Well-known examples are Shor's algorithm for factoring and Grover's algorithm for search
- Quantum computational complexity theory
- The field that investigates why quantum computation outperforms classical computation and quantifies the difference. Also called quantum complexity theory
- Quantum advantage
- When quantum computation outperforms classical computation
ResearchResearch themes
The main research themes are quantum algorithms and quantum computational complexity theory, and the lab investigates the advantage of quantum computation from a theoretical perspective. Its two pillars are discovering new algorithms and clarifying why quantum computation outperforms classical computation.
*Illustrative imageQuantum algorithms
Many quantum algorithms have been developed, such as Shor's factoring algorithm and Grover's search algorithm. The lab aims to discover new ones, find killer applications for quantum computers, and prove their advantage mathematically.
*Illustrative imageQuantum computational complexity theory
The central question is why quantum computation outperforms classical computation, and how to quantify that quantum advantage. The lab studies it in several complexity settings, including time, space, query, and communication complexity.
MembersFaculty
The members of the Quantum Algorithms and Complexity Theory Group include faculty and postdocs, doctoral and master's students, research students, and undergraduates.As of 2026
- ProfessorFrançois Le Gall
- Project Assistant ProfessorDhara Thakkar
- Project Assistant ProfessorAtsuya Hasegawa
VoicesStudent voices
Ratings and reviews reflect the experiences of individual current or former students, not the lab's official views. Whether a lab has reviews, or how many, says nothing about the lab itself.
Students who take part in an interview may receive a thank-you gift worth ¥1,000, regardless of what they say.
Student ratings (0 students)
--
--
--
--
--
--
Student voices answer questions like these
- What's great about this lab?
- What did you learn after joining?
- What's the vibe, and what is the professor like?
- Who is this lab for?
- Where do graduates go?
Your experience can help younger students choose their lab. Your name won't be shown.
Write a lab reviewAnonymous · Your draft is saved if you stopRelatedLabs similar to Quantum Information Theory, Theoretical Computer Science, and Algorithms Lab
Information Theory, Quantum Information Theory, Theoretical Computer Science, and Algorithm Theory Lab (Ryuhei Mori)School of Science, Department of MathematicsQuantum information, especially quantum algorithms, theoreti…
Probability Theory and Information Theory LabSchool of Science, Department of MathematicsInformation theory, particularly source coding (in simple te…
Graph Theory, Theoretical Computer Science, and Algorithms LabSchool of Science, Department of MathematicsResearch on graph theory, discrete optimization theory, and …
Mathematical Physics, General Relativity, and Cosmology LabSchool of Science, Department of MathematicsGeneral relativity and cosmology: geometric approaches to co…The information on this page is compiled by the LabLog team from the lab's public information and interviews. For corrections or removal requests, please contact LabLog, not the lab.
Report an errorAbout the images
The top and research theme images are illustrative and were not taken at the lab. They are cropped from Wikimedia Commons images. Cropped CC BY-SA images are provided under the same CC BY-SA license as the original (version shown on each line).
- Top image: “Google Sycamore Chip 001” Google (https://www.youtube.com/channel/UCK8sQmJBp8GCxrOtXWBpyEA) / CC BY 3.0 (cropped)
- Quantum algorithms: “Quantum Bomb Testing” Pdavis1443 / CC BY-SA 4.0 (cropped)
- Quantum computational complexity theory: “AaronsonEulerDiagP NPs BQP” Scott Aaronson / CC BY 3.0 (cropped)
- Related lab (Information Theory, Quantum Information Theory, Theoretical Computer Science, and Algorithm Theory Lab (Ryuhei Mori)): “Quantum Computer with Dispersive Background 2” OJB Quantum / CC BY 4.0 (cropped)
- Related lab (Probability Theory and Information Theory Lab): “Telecommunications equipment adjacent to The Three Sisters” Schwede66 / CC BY-SA 4.0 (cropped)
- Related lab (Graph Theory, Theoretical Computer Science, and Algorithms Lab): “Moreno Sociogram 5th Grade” Martin Grandjean / CC BY-SA 4.0 (cropped)
- Related lab (Mathematical Physics, General Relativity, and Cosmology Lab): “Orbits of stars around black hole at the heart of the Milky Way (eso1825d)” ESO/L. Calçada/spaceengine.org / CC BY 4.0 (cropped)
About LabLog
LabLog is a lab review app for students only. Student members at each university interview students in labs and publish what they say. Student voices can only be read by students who sign up with a university email address. Operated by bestiee Inc.
Learn more about LabLog ↗Search engines and AI may reference the basic lab info and rating summaries on this page and the description of LabLog. Student voices are for student members only. Automated collection by programs (scraping, or input to or training of AI) is prohibited under Article 8 of the Terms of Service. If you need data for research or analysis, please contact us.