Skip to content
#

quantum-computing

Here are 859 public repositories matching this topic...

Cirq
obriente
obriente commented Jul 30, 2020

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

HassanNaseri
HassanNaseri commented Sep 30, 2020

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

stylewarning
stylewarning commented Aug 5, 2020

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                           

Improve this page

Add a description, image, and links to the quantum-computing topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the quantum-computing topic, visit your repo's landing page and select "manage topics."

Learn more

You can’t perform that action at this time.