NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

PUBLICATIONS

Testing quantum expanders is co-QMA-complete

Published

Author(s)

Yi-Kai Liu, Stephen P. Jordan, Pawel Wocjan, Adam Bookatz

Abstract

A quantum expander is a unital quantum channel that is rapidly mixing, has only a few Kraus operators, and can be implemented efficiently on a quantum computer. We consider the problem of estimating the mixing time (i.e., the spectral gap) of a quantum expander. We show that this problem is co-QMA-complete. This has applications to testing randomized constructions of quantum expanders, and studying thermalization of open quantum systems.
Citation
Theory of Computing Systems
Pub Type
Journals

Download Paper

Local Download

Keywords

Computational complexity, quantum information, quantum expanders, mixing time, thermalization
Information technology and Quantum information science

Citation

Liu, Y. , Jordan, S. , Wocjan, P. and Bookatz, A. (2013), Testing quantum expanders is co-QMA-complete, Theory of Computing Systems, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=912561 (Accessed October 15, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created May 31, 2013, Updated February 19, 2017
Was this page helpful?