Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
Xavier Bonet-Monroig, Ryan Babbush, Thomas E. O’Brien
Abstract
A new analysis provides bounds on the size of ``clique covers''---mutually commuting subsets of quantum state observables---and hence the time required for certain near-term quantum computing applications.
Topics & Concepts
Quantum stateQuantumComputer scienceQuantum computerQuantum tomographyState (computer science)Scheduling (production processes)Statistical physicsAlgorithmQuantum algorithmQuantum informationQuantum annealingPhysicsQuantum mechanicsQuantum error correctionTomographyQuantum sensorQuantum operationQuantum phase estimation algorithmQuantum processQuantum systemField (mathematics)Processor schedulingQuantum networkUpper and lower boundsQuantum technologyQuantum Computing Algorithms and ArchitectureQuantum many-body systemsQuantum Information and Cryptography