Benchmarking quantum processors with a single qubit

DOI10.1007/s11128-020-02642-4OpenAlexW3010990664MaRDI QIDQ2677203

Kent Bonsma-Fisher, Oktay Göktaş, Weng Kian Tham, Aharon Brodutch

Publication date: 13 January 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.05775

zbMATH Keywords

Jones polynomialsIBMNISQDQC1quantum benchmarking

Mathematics Subject Classification ID

Quantum computation (81P68)

Uses Software

• GitHub

Cites Work

• A polynomial upper bound on Reidemeister moves
• Hecke algebra representations of braid groups and link polynomials
• Estimating Jones polynomials is a complete problem for one clean qubit
• A polynomial invariant for knots via von Neumann algebras
• Estimating the coherence of noise
• A polynomial quantum algorithm for approximating the Jones polynomial
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Benchmarking quantum processors with a single qubit