Efficient quantum computing with weak measurements

DOI10.1088/1367-2630/13/5/053024zbMath1448.81246arXiv1101.4510OpenAlexW3100712140MaRDI QIDQ5135849

Austin P. Lund

Publication date: 24 November 2020

Published in: New Journal of Physics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15)

Related Items (1)

Overcoming experimental limitations in a nonlinear two-qubit gate through postselection

Cites Work

• Unnamed Item
• Unnamed Item
• Fault-Tolerant Quantum Computation with Constant Error Rate
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Measuring measurement–disturbance relationships with weak values

This page was built for publication: Efficient quantum computing with weak measurements