Here are some examples:

• Root README is missing machine learning category of samples
• README in algorithms is missing repeat-until-success and sudoku-grover
• [README in diagnostics](https://github.com/microsoft/Quantum/blob/main/samples/diagnostics/RE

In #478 we migrated to the new way of marking Q# unit tests using @Test attribute (compared to the old way that involved a C# wrapper calling certain Q# operations). This means that we're no longer restricted by the inconvenience of directing different tests in one kata to run on different simulators. In multiple cases there are only one or two tasks in a kata which require CounterSimulator, t

Information

• Qiskit Terra version: master
• Python version:
• Operating system:

What is the current behavior?

As pointed out by @HwajungKang, it is a bit tricky to figure out that the color wheels are more or less rotated by pi.

Is your feature request related to a use case or problem? Please describe.

Docstrings are a returning issue on PRs, it would be great if we could automate the feedback on them as well for Google style docstrings.

Describe the solution you'd like

Setup the docstyle and [docparams](ht

To get this codebase up to standard, we need to add type hints. At the very least, perhaps we should start insisting that all new code has type hints added, but moreover we need to add typing to the code that currently exists.

This is a pretty large project, but luckily it can be done incrementally - I believe at this point it's a stretch goal for v1, if anyone wants to help it would be much ap

Running travis lint gives a bunch of warning. Like for instance, sudo : required is no longer needed, and Travis migrated to a new architecture. So the travis.yml file needs to be updated.

https://blog.travis-ci.com/2018-10-04-combining-linux-infrastructures

For example, pylint would have caught ProjectQ-Framework/ProjectQ#19 via an undefined variable warning.

Requested Feature

LinearEqualityToPenalty converter only accepts a single scalar input as penalty factor. Better results can be usually obtained by applying higher penalty factors to broken constraints. This requires LinearEqualityToPenalty to accept a list of penalty terms as input, including separate penalty factor for each constraint. If user provides none or a single value for penalty, the

Repro:

(describe #'COMMUTE-RZ-AFTER-CPHASE)

Output:

#<COMPILER COMMUTE-RZ-AFTER-CPHASE {10149CF36B}>
  [funcallable-instance]


Lambda-list: (X Y &KEY CONTEXT)
Derived type: (FUNCTION (T T &KEY (:CONTEXT T)) (VALUES T &OPTIONAL))
Documentation:
  T
Source file: quilc/src/compressor/rewriting-rules.lisp

Slots with :INSTANCE allocation:
  NAME                           

Now, there's no unit test.