Currently, most samples only have a C# host program. It would be nice if more or even most samples demonstrated how to use Python to call into Q#.

Samples with Python Hosts

• algorithms
  • chsh-game
  • database-search
  • integer-factorization
  • oracle-synthesis
  • order-finding
  • reversible-logic-synthesis
  • simple-grover

• arithmetic

Currently the tests for tasks 1.6 and 2.2 generate the SAT instances randomly, with up to 7 variables and 14 clauses, which can cause significant test slowdown if several tests are generated on the larger side (the more vari

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.

Context: quantumlib/Cirq#3322 (comment)

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.