Quantum Expanders: Motivation and Constructions

Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma

Research output: Contribution to journalArticlepeer-review


We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic, and is based on the construction of Cayley Ramanujan graphs over the group PGL(2,q) given by Lubotzky, Phillips, and Sarnak (1988). The second construction is combinatorial, and is based on a quantum variant of the Zig-Zag product introduced by Reingold, Vadhan, and Wigderson (2000). Both constructions are of constant degree, and the second one is explicit.

Using another construction of quantum expanders by Ambainis and Smith (2004), we characterize the complexity of comparing and estimating quantum entropies. Specifically, we consider the following task: given two mixed states, each given by a quantum circuit generating it, decide which mixed state has more entropy. We show that this problem is QSZK—complete (where QSZK is the class of languages having a zero-knowledge quantum interactive protocol). This problem is very well motivated from a physical point of view. Our proof follows the classical proof structure that the entropy difference problem is SZK—complete, but crucially depends on the use of quantum expanders.
Original languageEnglish
Pages (from-to)47-79
Number of pages33
JournalTheory of Computing
Issue number3
StatePublished - May 2010


Dive into the research topics of 'Quantum Expanders: Motivation and Constructions'. Together they form a unique fingerprint.

Cite this