- About
- Events
- Calendar
- Graduation Information
- Cornell Learning Machines Seminar
- Student Colloquium
- BOOM
- Fall 2024 Colloquium
- Conway-Walker Lecture Series
- Salton 2024 Lecture Series
- Seminars / Lectures
- Big Red Hacks
- Cornell University - High School Programming Contests 2024
- Game Design Initiative
- CSMore: The Rising Sophomore Summer Program in Computer Science
- Explore CS Research
- ACSU Research Night
- Cornell Junior Theorists' Workshop 2024
- People
- Courses
- Research
- Undergraduate
- M Eng
- MS
- PhD
- Admissions
- Current Students
- Computer Science Graduate Office Hours
- Advising Guide for Research Students
- Business Card Policy
- Cornell Tech
- Curricular Practical Training
- A & B Exam Scheduling Guidelines
- Fellowship Opportunities
- Field of Computer Science Ph.D. Student Handbook
- Graduate TA Handbook
- Field A Exam Summary Form
- Graduate School Forms
- Instructor / TA Application
- Ph.D. Requirements
- Ph.D. Student Financial Support
- Special Committee Selection
- Travel Funding Opportunities
- Travel Reimbursement Guide
- The Outside Minor Requirement
- Diversity and Inclusion
- Graduation Information
- CS Graduate Minor
- Outreach Opportunities
- Parental Accommodation Policy
- Special Masters
- Student Spotlights
- Contact PhD Office
The Role of Randomness in Quantum State Certification with Unentangled Measurements (via Zoom)
Abstract: Given n copies of an unknown quantum state ρ∈C^{d×d}, quantum state certification is the task of determining whether ρ=ρ0 or ∥ρ−ρ0∥_1>ε, where ρ0 is a known reference state. We study quantum state certification using unentangled quantum measurements, namely measurements which operate only on one copy of ρ at a time. When there is a common source of randomness available and the unentangled measurements are chosen based on this randomness, prior work has shown that Θ(d^(3/2)/ε^2) copies are necessary and sufficient. This holds even when the measurements are allowed to be chosen adaptively. We consider deterministic measurement schemes (as opposed to randomized) and demonstrate that Θ(d^2/ε^2) copies are necessary and sufficient for state certification. This shows a separation between algorithms with and without randomness.
We develop a unified lower bound framework for both fixed and randomized measurements, under the same theoretical framework that relates the hardness of testing to the well-established Lüders rule. More precisely, we obtain lower bounds for randomized and fixed schemes as a function of the eigenvalues of the Lüders channel which characterizes one possible post-measurement state transformation.
Bio: Yuhan Liu is a 6th-year PhD candidate in ECE at Cornell University, advised by Prof. Jayadev Acharya. His research interest lies in federated learning, differential privacy, and quantum information theory.