stabilizer_qec 1.5.0

Quantum error-correction simulation and decoding: Stim-format circuits and error models, a bit-parallel sampler, sparse-blossom, correlated and belief matching, BP+OSD, window decoders, bivariate bicycle codes and lattice surgery.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65

//! Every unitary one- and two-qubit gate of Stim's that the engine does not have as an
//! instruction of its own, as the shortest sequence of H, S and CX whose tableau equals
//! Stim's exactly, signs included. Generated by tools/gen_gates.py (Stim 1.16.0); do not edit.

/// One step of a decomposition, on the gate's target slots (0, or 0 and 1).
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub enum Step {
    H(u8),
    S(u8),
    Cx(u8, u8),
}

/// A gate: its name, how many targets it takes, its decomposition and its other names.
pub struct GateDef {
    pub name: &'static str,
    pub arity: u8,
    pub steps: &'static [Step],
    pub aliases: &'static [&'static str],
}

pub const GATES: &[GateDef] = &[
    GateDef { name: "CXSWAP", arity: 2, steps: &[Step::Cx(1, 0), Step::Cx(0, 1)], aliases: &[] },
    GateDef { name: "CY", arity: 2, steps: &[Step::H(0), Step::Cx(1, 0), Step::H(0), Step::S(0), Step::Cx(0, 1)], aliases: &["ZCY"] },
    GateDef { name: "CZSWAP", arity: 2, steps: &[Step::H(0), Step::Cx(0, 1), Step::Cx(1, 0), Step::H(1)], aliases: &["SWAPCZ"] },
    GateDef { name: "C_NXYZ", arity: 1, steps: &[Step::H(0), Step::S(0), Step::H(0), Step::S(0), Step::S(0), Step::S(0)], aliases: &[] },
    GateDef { name: "C_NZYX", arity: 1, steps: &[Step::H(0), Step::S(0), Step::H(0), Step::S(0), Step::S(0), Step::H(0)], aliases: &[] },
    GateDef { name: "C_XNYZ", arity: 1, steps: &[Step::S(0), Step::H(0)], aliases: &[] },
    GateDef { name: "C_XYNZ", arity: 1, steps: &[Step::S(0), Step::H(0), Step::S(0), Step::S(0)], aliases: &[] },
    GateDef { name: "C_XYZ", arity: 1, steps: &[Step::H(0), Step::S(0), Step::H(0), Step::S(0)], aliases: &[] },
    GateDef { name: "C_ZNYX", arity: 1, steps: &[Step::H(0), Step::S(0), Step::S(0), Step::S(0)], aliases: &[] },
    GateDef { name: "C_ZYNX", arity: 1, steps: &[Step::S(0), Step::S(0), Step::H(0), Step::S(0)], aliases: &[] },
    GateDef { name: "C_ZYX", arity: 1, steps: &[Step::H(0), Step::S(0)], aliases: &[] },
    GateDef { name: "H_NXY", arity: 1, steps: &[Step::S(0), Step::H(0), Step::S(0), Step::S(0), Step::H(0)], aliases: &[] },
    GateDef { name: "H_NXZ", arity: 1, steps: &[Step::S(0), Step::S(0), Step::H(0), Step::S(0), Step::S(0)], aliases: &[] },
    GateDef { name: "H_NYZ", arity: 1, steps: &[Step::S(0), Step::H(0), Step::S(0), Step::S(0), Step::S(0)], aliases: &[] },
    GateDef { name: "H_XY", arity: 1, steps: &[Step::H(0), Step::S(0), Step::S(0), Step::H(0), Step::S(0)], aliases: &[] },
    GateDef { name: "H_YZ", arity: 1, steps: &[Step::H(0), Step::S(0), Step::H(0), Step::S(0), Step::S(0)], aliases: &[] },
    GateDef { name: "II", arity: 2, steps: &[], aliases: &[] },
    GateDef { name: "ISWAP", arity: 2, steps: &[Step::Cx(0, 1), Step::S(1), Step::Cx(1, 0), Step::Cx(0, 1)], aliases: &[] },
    GateDef { name: "ISWAP_DAG", arity: 2, steps: &[Step::Cx(0, 1), Step::S(1), Step::S(1), Step::S(1), Step::Cx(1, 0), Step::Cx(0, 1)], aliases: &[] },
    GateDef { name: "SQRT_X", arity: 1, steps: &[Step::H(0), Step::S(0), Step::H(0)], aliases: &[] },
    GateDef { name: "SQRT_XX", arity: 2, steps: &[Step::Cx(0, 1), Step::H(0), Step::S(0), Step::H(0), Step::Cx(0, 1)], aliases: &[] },
    GateDef { name: "SQRT_XX_DAG", arity: 2, steps: &[Step::S(0), Step::Cx(0, 1), Step::H(0), Step::S(0), Step::Cx(0, 1)], aliases: &[] },
    GateDef { name: "SQRT_X_DAG", arity: 1, steps: &[Step::S(0), Step::H(0), Step::S(0)], aliases: &[] },
    GateDef { name: "SQRT_Y", arity: 1, steps: &[Step::S(0), Step::S(0), Step::H(0)], aliases: &[] },
    GateDef { name: "SQRT_YY", arity: 2, steps: &[Step::S(0), Step::Cx(1, 0), Step::H(1), Step::S(0), Step::S(0), Step::Cx(1, 0), Step::S(0)], aliases: &[] },
    GateDef { name: "SQRT_YY_DAG", arity: 2, steps: &[Step::Cx(0, 1), Step::H(0), Step::S(0), Step::H(0), Step::S(1), Step::Cx(1, 0), Step::Cx(0, 1)], aliases: &[] },
    GateDef { name: "SQRT_Y_DAG", arity: 1, steps: &[Step::H(0), Step::S(0), Step::S(0)], aliases: &[] },
    GateDef { name: "SQRT_ZZ", arity: 2, steps: &[Step::Cx(0, 1), Step::S(1), Step::Cx(0, 1)], aliases: &[] },
    GateDef { name: "SQRT_ZZ_DAG", arity: 2, steps: &[Step::Cx(0, 1), Step::S(1), Step::S(1), Step::S(1), Step::Cx(0, 1)], aliases: &[] },
    GateDef { name: "SWAP", arity: 2, steps: &[Step::Cx(0, 1), Step::Cx(1, 0), Step::Cx(0, 1)], aliases: &[] },
    GateDef { name: "SWAPCX", arity: 2, steps: &[Step::Cx(0, 1), Step::Cx(1, 0)], aliases: &[] },
    GateDef { name: "S_DAG", arity: 1, steps: &[Step::S(0), Step::S(0), Step::S(0)], aliases: &["SQRT_Z_DAG"] },
    GateDef { name: "XCX", arity: 2, steps: &[Step::H(0), Step::Cx(0, 1), Step::H(0)], aliases: &[] },
    GateDef { name: "XCY", arity: 2, steps: &[Step::Cx(1, 0), Step::H(0), Step::S(0), Step::Cx(0, 1), Step::H(0)], aliases: &[] },
    GateDef { name: "XCZ", arity: 2, steps: &[Step::Cx(1, 0)], aliases: &[] },
    GateDef { name: "YCX", arity: 2, steps: &[Step::Cx(0, 1), Step::H(1), Step::S(1), Step::Cx(1, 0), Step::H(1)], aliases: &[] },
    GateDef { name: "YCY", arity: 2, steps: &[Step::H(0), Step::H(1), Step::S(0), Step::Cx(1, 0), Step::H(1), Step::Cx(1, 0), Step::S(0)], aliases: &[] },
    GateDef { name: "YCZ", arity: 2, steps: &[Step::H(0), Step::S(1), Step::Cx(1, 0), Step::H(0), Step::Cx(1, 0)], aliases: &[] },
];

/// The gate a name (or alias) denotes.
pub fn find(name: &str) -> Option<&'static GateDef> {
    GATES.iter().find(|g| g.name == name || g.aliases.contains(&name))
}