Sequential Quantum Gate Decomposer  v1.9.6
Powerful decomposition of general unitarias into one- and two-qubit gates gates
correctness_evidence/bundle.py
Go to the documentation of this file.
1 from __future__ import annotations
2 
3 from copy import deepcopy
4 from functools import lru_cache
5 
6 from benchmarks.density_matrix.correctness_evidence.common import (
7  CORRECTNESS_EVIDENCE_PHASE31_PACKAGE_SCHEMA_VERSION,
8  CORRECTNESS_PACKAGE_SCHEMA_VERSION,
9  build_selected_candidate,
10 )
11 from benchmarks.density_matrix.correctness_evidence.records import (
12  build_negative_records,
13  build_phase31_correctness_evidence_positive_records,
14  build_positive_records,
15  counted_supported_case,
16 )
17 
18 
19 @lru_cache(maxsize=1)
21  positive_cases = build_positive_records()
22  negative_cases = build_negative_records()
23  counted_supported_cases = [
24  case for case in positive_cases if counted_supported_case(case)
25  ]
26  package = {
27  "schema_version": CORRECTNESS_PACKAGE_SCHEMA_VERSION,
28  "selected_candidate": build_selected_candidate(),
29  "cases": positive_cases,
30  "negative_cases": negative_cases,
31  "summary": {
32  "total_cases": len(positive_cases),
33  "counted_supported_cases": len(counted_supported_cases),
34  "excluded_supported_cases": len(positive_cases) - len(counted_supported_cases),
35  "external_reference_cases": sum(
36  case["external_reference_required"] for case in positive_cases
37  ),
38  "actual_fused_cases": sum(
39  case["actual_fused_execution"] for case in positive_cases
40  ),
41  "unsupported_boundary_cases": len(negative_cases),
42  "planner_entry_boundary_cases": sum(
43  case["boundary_stage"] == "planner_entry" for case in negative_cases
44  ),
45  "descriptor_generation_boundary_cases": sum(
46  case["boundary_stage"] == "descriptor_generation"
47  for case in negative_cases
48  ),
49  "runtime_stage_boundary_cases": sum(
50  case["boundary_stage"] == "runtime_stage" for case in negative_cases
51  ),
52  },
53  }
54  return package
55 
56 
59 
60 
63 
64 
65 @lru_cache(maxsize=1)
68  negative_cases = build_negative_records()
69  counted_supported_cases = [
70  case for case in positive_cases if counted_supported_case(case)
71  ]
72  return {
73  "schema_version": CORRECTNESS_EVIDENCE_PHASE31_PACKAGE_SCHEMA_VERSION,
74  "selected_candidate": build_selected_candidate(),
75  "cases": positive_cases,
76  "negative_cases": negative_cases,
77  "summary": {
78  "total_cases": len(positive_cases),
79  "counted_supported_cases": len(counted_supported_cases),
80  "excluded_supported_cases": len(positive_cases) - len(counted_supported_cases),
81  "external_reference_cases": sum(
82  case["external_reference_required"] for case in positive_cases
83  ),
84  "actual_fused_cases": sum(
85  case["actual_fused_execution"] for case in positive_cases
86  ),
87  "unsupported_boundary_cases": len(negative_cases),
88  "planner_entry_boundary_cases": sum(
89  case["boundary_stage"] == "planner_entry" for case in negative_cases
90  ),
91  "descriptor_generation_boundary_cases": sum(
92  case["boundary_stage"] == "descriptor_generation"
93  for case in negative_cases
94  ),
95  "runtime_stage_boundary_cases": sum(
96  case["boundary_stage"] == "runtime_stage" for case in negative_cases
97  ),
98  "continuity_cases": sum(
99  case["case_kind"] == "continuity" for case in positive_cases
100  ),
101  "microcases": sum(case["case_kind"] == "microcase" for case in positive_cases),
102  "structured_cases": sum(
103  case["case_kind"] == "structured_family" for case in positive_cases
104  ),
105  },
106  }
107 
108 
110  """Stage-A bounded Phase 3.1 package (six positive cases + shared negative boundary records)."""
def build_correctness_evidence_correctness_package_payload()
def build_phase31_correctness_evidence_positive_records()
def build_correctness_package_payload()
def _build_phase31_correctness_package_payload_cached()
def _build_correctness_package_payload_cached()
def build_phase31_correctness_package_payload()
def counted_supported_case