pith. sign in

For the greedy search heuristic we do so by mapping the problem to a combinatorial optimization problem which we approximate the solution to using greedy search

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

quant-ph 1

years

2023 1

verdicts

UNVERDICTED 1

representative citing papers

Near-Minimal Gate Set Tomography Experiment Designs

quant-ph · 2023-08-17 · unverdicted · novelty 7.0

A method to create near-minimal GST experiment designs for two qubits that maintain Heisenberg-like precision scaling with far fewer circuits than standard designs.

citing papers explorer

Showing 1 of 1 citing paper.

  • Near-Minimal Gate Set Tomography Experiment Designs quant-ph · 2023-08-17 · unverdicted · none · ref 26

    A method to create near-minimal GST experiment designs for two qubits that maintain Heisenberg-like precision scaling with far fewer circuits than standard designs.