Control aspects of quantum computing using pure and mixed states

DOI10.1098/rsta.2011.0513zbMath1329.81156OpenAlexW1981629929WikidataQ43073408 ScholiaQ43073408MaRDI QIDQ2941614

Steffen J. Glaser, Louis H. Kauffman, Navin Khaneja, Amr F. Fahmy, Raimund Marx, S. J. jun. Lomonaco, Th. Schulte-Herbrüggen

Publication date: 21 August 2015

Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1098/rsta.2011.0513

zbMATH Keywords

Jones polynomialquantum computingknot theoryoptimal quantum controlunitary gate design

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum control (81Q93)

Related Items (6)

Nuclear magnetic resonance quantum information processing ⋮ GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls ⋮ NMR quantum information processing: Indian contributions and perspectives ⋮ Coherent control of a qubit is trap-free ⋮ Efficient experimental design of high-fidelity three-qubit quantum gates via genetic programming ⋮ Quantum control with noisy fields: computational complexity versus sensitivity to noise

Cites Work

• The quantum query complexity of the hidden subgroup problem is polynomial
• Universal Quantum Simulators
• Quantum algorithms and the Fourier transform
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Boundary of quantum evolution under decoherence
• A polynomial quantum algorithm for approximating the Jones polynomial
• A polynomial quantum algorithm for approximating the Jones polynomial
• Unnamed Item

This page was built for publication: Control aspects of quantum computing using pure and mixed states