Combinatorics and Optimization researchers use computational complexity to further understand the quantum partition function

Wednesday, October 12, 2022

Institute for Quantum ComputingAnirban Chowdury and David Gosset, a postdoc and an associate professor in the department of Combinatorics and Optimization, have published new research as part of their work at the Institute for Quantum Computing. Chowdury and Gosset are collaborating with IBM researchers Sergey Bravyi and Pawel Wocjan to explore the interface between computational complexity and quantum many-body physics.

Computational complexity is a field of computer science in which researchers work to understand the resources needed to solve computational problems. In this most recent research, the results of which were published last week in Nature Physics, Chowdhury and Gosset work to understand the computational complexity of approximating a quantity known as the quantum partition function.

To learn more about computational complexity, and how Faculty of Mathematics researchers are using it to advance long-standing quantum computing problems, check out the full article here from the Institute for Quantum Computing.

Get these news items on your student portal

  1. 2023 (11)
    1. January (11)
  2. 2022 (127)
    1. December (7)
    2. November (12)
    3. October (8)
    4. September (8)
    5. August (4)
    6. July (4)
    7. June (13)
    8. May (23)
    9. April (10)
    10. March (15)
    11. February (13)
    12. January (10)
  3. 2021 (143)
    1. December (9)
    2. November (21)
    3. October (19)
    4. September (17)
    5. August (13)
    6. July (12)
    7. June (8)
    8. May (11)
    9. April (7)
    10. March (10)
    11. February (6)
    12. January (10)
  4. 2020 (143)
  5. 2019 (126)
  6. 2018 (99)
  7. 2017 (17)
  8. 2016 (17)
  9. 2015 (19)
  10. 2014 (24)
  11. 2013 (24)
  12. 2012 (18)