Skip to main content Skip to secondary navigation
Main content start

Chinmay Nirkhe (IBM)

The Description Complexity of Quantum States

Event Details:

Wednesday, March 8, 2023
12:00pm - 1:00pm PST


Physics & Astrophysics Building, Room 102/103

Quantum states wear many hats in quantum information: they simultaneously generalize distributions from classical complexity theory, describe quantum mechanical phenomena, and capture the complexity of quantum computation. This myriad of roles makes understanding the complexity of quantum states a central question in quantum complexity theory. In this talk, we will explore the complexity of classically describing physically relevant quantum states. In particular, we will discuss the complexity of ground states and low-energy states of local Hamiltonians. This talk is based on recent progress on the NLTS problem [1], QCMA vs QMA [2], and search-to-decision for QMA [3].

[1] NLTS Hamiltonians from good quantum codes. A. Anshu, N. Breuckmann, and C. Nirkhe.
[2] A classical oracle separation between QMA and QCMA. A. Natarajan and C. Nirkhe.
[3] Quantum search-to-decision and the state synthesis problem. S. Irani, A. Natarajan, C. Nirkhe, S. Rao, and H. Yuen.

Research Interests: Chinmay Nirkhe’s research interests are in theoretical computer science centered around quantum information and hardness of approximation. He is currently interesting in studying the quantum PCP conjecture and the complexity of quantum states.

Related Topics

Explore More Events

  • Q-FARM Seminar

    Zoe Yan (Princeton)

    Quantum many-body physics with ultracold molecules
  • Q-FARM Seminar

    Jeff Thompson (Princeton)

    "Quantum computing with neutral ytterbium atoms"
    Physics & Astrophysics Building, Room 102/103
  • Q-FARM Seminar

    Jun Ye (JILA)

    Quantum matter and clock: from emergent phenomena to fundamental physics
    Physics & Astrophysics Building, Room 102/103