The geometry of quantum learning
type: Item
instance of: scholarly article
title: The geometry of quantum learning
zbMATH Open document ID: 1194.81045
author: Markus Hunziker
author: David A. Meyer
author: Ji-Hun Park
author: James Pommersheim
author: Mitchell J. Rothstein
published in: Quantum Information Processing
publication date: 2010-08-23T00:00:00Z
full work available at URL: https://arxiv.org/abs/quant-ph/0309059
Mathematics Subject Classification ID: 81P68
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q12
zbMATH DE Number: 5774215
zbMATH Keywords: quantum algorithms
zbMATH Keywords: Procrustes problem
MaRDI profile type: Publication
OpenAlex ID: W2122964527
arXiv ID: quant-ph/0309059
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
cites work: Poly-locality in quantum computing
cites work: Q4228473
cites work: Q4819589
cites work: Quantum complexity theory
cites work: Quantum Complexity Theory
cites work: Q4398828
cites work: On the mathematical foundations of learning
cites work: Q4198056
cites work: Quantum algorithms revisited
cites work: Strengths and Weaknesses of Quantum Computing
cites work: Statistical decision theory for quantum systems
cites work: Optimal multiple quantum statistical hypothesis testing
cites work: Quantum detection and estimation theory
cites work: Matrix Analysis
cites work: On quantum detection and the square-root measurement
cites work: Reversing quantum dynamics with near-optimal quantum and classical fidelity
cites work: Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
cites work: A theory of the learnable
cites work: STACS 2004
cites work: Improved bounds on quantum learning algorithms
DOI: 10.1007/S11128-009-0129-6
description: scientific article