LAB LOGA page on LabLog, a review site (not the lab's official page)
Information Theory, Quantum Information Theory, Theoretical Computer Science, and Algorithm Theory Lab (Ryuhei Mori)
Machine-translated · View original
The lab explores the mathematical aspects of quantum information.
AboutAbout the lab
Studying quantum information from the mathematical side.
The Mori Lab studies the mathematical aspects of quantum information.
Few labs in Japan study quantum information within a mathematics-oriented graduate school.
The lab works on the complexity of generating graph states and on quantum algorithms for graph problems.
Fourth-year undergraduates start by reading an introductory book on quantum information in a reading group, study on their own over the summer break, and in autumn choose a research topic and move on to their graduation research.
Key terms
- Quantum information
- A field that deals with representing, processing, and communicating information using the properties of quantum mechanics.
- Graph state
- A quantum state in which multiple qubits are entangled with each other, represented by a graph of points and the lines connecting them.
- Quantum query algorithm
- A quantum algorithm whose efficiency is measured by the number of queries made to data.
ResearchResearch themes
The lab studies the mathematical aspects of quantum information. It works on the complexity of generating graph states and on developing quantum query algorithms for graph problems.
*Illustrative imageComplexity of Generating Graph States
Graph states are quantum states used in measurement-based quantum computation and quantum error-correcting codes. The lab defined "complexity" as the minimum number of two-qubit Clifford operations needed to generate a graph state, and derived upper and lower bounds on it using the rank-width of the graph.
*Illustrative imageQuantum Query Algorithms for Graph Problems
For the vertex cover problem and the matching problem on graphs, the lab developed quantum query algorithms by incorporating kernelization, a technique used in classical algorithms. It has also derived tight lower bounds on the number of queries (query complexity).
MembersFaculty
- Associate ProfessorRyuhei Mori
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 Information Theory, Quantum Information Theory, Theoretical Computer Science, and Algorithm Theory Lab (Ryuhei Mori)
Quantum Information Theory, Theoretical Computer Science, and Algorithms LabSchool of Science, Department of MathematicsTheoretical computer science: graph algorithms, algebraic al…
Nagao LabSchool of Science, Department of MathematicsWe have studied the fundamental theory of random matrices (m…
Graph Theory, Theoretical Computer Science, and Algorithms LabSchool of Science, Department of MathematicsResearch on graph theory, discrete optimization theory, and …
Combinatorics, Theoretical Computer Science, Algorithm Theory, and Optimization Theory Lab (Hiroshi Hirai)School of Science, Department of MathematicsResearch on optimization and algorithms, with interest in th…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: “Quantum Computer with Dispersive Background 2” OJB Quantum / CC BY 4.0 (cropped)
- Complexity of Generating Graph States: “Quantum gate teleportation” Vtomole / CC BY-SA 4.0 (cropped)
- Quantum Query Algorithms for Graph Problems: “Graph example (Graph theory)” Römert / CC BY-SA 3.0 (cropped)
- Related lab (Quantum Information Theory, Theoretical Computer Science, and Algorithms Lab): “Google Sycamore Chip 001” Google (https://www.youtube.com/channel/UCK8sQmJBp8GCxrOtXWBpyEA) / CC BY 3.0 (cropped)
- Related lab (Nagao Lab): “Assorted dice for games, 2024” Ironmaidenfun / 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 (Combinatorics, Theoretical Computer Science, Algorithm Theory, and Optimization Theory Lab (Hiroshi Hirai)): “Imperialist-competitive-algorithm-flowchart-bg” Original author: Icasite Author of the derivative work: Spiritia / CC BY-SA 3.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.