Expressiveness of matchgates.
type: Item
instance of: scholarly article
title: Expressiveness of matchgates.
zbMATH Open document ID: 1051.68064
DOI: 10.1016/S0304-3975(01)00325-5
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 1857072
author: Leslie G. Valiant
MaRDI profile type: Publication
cites work: Combinatorial matrix theory
cites work: Quantum computational networks
cites work: Matrices and matroids for systems analysis
cites work: Q2706552
cites work: Q4344138
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
cites work: A complexity theory based on Boolean algebra
cites work: Quantum computers that can be simulated classically in polynomial time
description: scientific article; zbMATH DE number 1857072