INNER CODE UNIT · C++
a
aromanro/QCSim · QCSim/CliffordTests.cpp:625
const size_t a = actions() % n, b = (a + 1 + actions() % (n - 1)) % n;
ApplyGate(sim, int(actions() % 15), int(a), int(b));
if (step % 9 != 0)
continue;
for (size_t width : {size_t(1), size_t(3), n + 2})
{
std::vector<size_t> qubits(width);
for (size_t q = 0; q < width; ++q)
qubits[q] = (n - 1 - q % n);
const CliffordRegressionSimulator before(sim);
CliffordRegressionSimulator ref(sim);
ref.SaveState();
ref.SetSeed(12391);
sim.SetSeed(12391);
std::unordered_map<std::vector<bool>, size_t> expected;
std::vector<bool> firstExpected;
for (size_t shot = 0; shot < 31; ++shot)
{