[Optional] Demonstrate P==NP

[daxfohl]

...in the presence of closed timelike curves.

Some rando once wrote up an algorithm for solving the boolean satisfiability problem in polynomial time on a quantum circuit, assuming the presence of closed timelike curves. This is an implementation of that algorithm in Cirq.

https://arxiv.org/abs/quant-ph/0309189v2

I just thought it was interesting and wanted to check that it actually worked. Feel free to discard this as not relevant if it's not .

cc @dabacon

[codecov]

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 98.66%. Comparing base (8c5753d) to head (ff3e18c).

Additional details and impacted files

@@            Coverage Diff             @@
##             main    #7322      +/-   ##
==========================================
- Coverage   98.66%   98.66%   -0.01%     
==========================================
  Files        1106     1107       +1     
  Lines       96448    96515      +67     
==========================================
+ Hits        95165    95230      +65     
- Misses       1283     1285       +2     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.
• 📦 JS Bundle Analysis: Save yourself from yourself by tracking and limiting bundle sizes in JS merges.