The computational complexity of ball permutations
type: Item
instance of: scholarly article
title: The computational complexity of ball permutations
zbMATH Open document ID: 1369.68203
DOI: 10.1145/3055399.3055453
author: Scott Aaronson
author: Adam Bouland
author: Greg Kuperberg
author: Saeed Mehraban
publication date: 2017-08-17T00:00:00Z
full work available at URL: https://arxiv.org/abs/1610.06646
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q12
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 6761818
zbMATH Keywords: exchange interaction
zbMATH Keywords: intermediate models
zbMATH Keywords: one clean qubit
zbMATH Keywords: quantum complexity theory
MaRDI profile type: Publication
OpenAlex ID: W2545038605
arXiv ID: 1610.06646
Wikidata QID: Q130957087
published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
description: scientific article; zbMATH DE number 6761818