Lev S Bishop

To flesh out Blake's suggestion (2): we could allow `defcal` to also target a new thing more general than unitary gate. Call it "foo" for now because choosing the correct...

My concern with this is that by changing from treating the parameters as exact angles to considering them as inexact types, then we can no longer represent the mathematical equivalence...

Pulled the parameter typing question out into a separate issue #375. General consensus from discussion at the last TSC meeting was that the remainder of this PR is in good...

Here's a toy demo based on the conditional binomial method as implemented in numpy, etc. The single-threaded version is similar to the implementation in numpy. Performance depends on the binomial...

Failing example: ``` tex \documentclass{article} \usepackage{minted} \setminted{codetagify={TAG1,TAG2}} \begin{document} \usemintedstyle{colorful} \begin{minted}{yaml} # TAG1: this is first tag, it works # TAG2: this is second tag, it doesn't work \end{minted} \end{document} ```

I'm not super familiar with this stuff, but I think it might be easier to derive from `UserDict` (which itself is a `Mapping`) and override `__missing__` rather than `__getitem__`.

This now looks like what I had in mind. @mtreinish do you agree with this approach?

Now that #11797 and #11798 have landed it will be good to capture more failing examples here (along with the numpy versioning info) and hopefully there's a pattern to spot

I like the general idea to drop negligible gates but think this implementation is not optimal. `TwoQubitBasisDecomposer` will already drop all negligible 2q gates, not just the ones in a...

```python try: decomp = TwoQubitWeylDecomposition(node.op, fidelity=fid, _specialization=_specializations.IdEquiv) except QiskitError: pass else: ```