Home
last modified time | relevance | path

Searched refs:cca (Results 1 – 25 of 1701) sorted by relevance

12345678910>>...69

/dports/net/rtpproxy/rtpproxy-2.1.1/src/
H A Drtpp_command_parse.c67 cmd->cca.op = UPDATE;
79 cmd->cca.op = LOOKUP;
91 cmd->cca.op = DELETE;
103 cmd->cca.op = PLAY;
115 cmd->cca.op = RECORD;
131 cmd->cca.op = COPY;
143 cmd->cca.op = NOPLAY;
169 cmd->cca.hint = "V";
179 cmd->cca.op = INFO;
190 cmd->cca.op = QUERY;
[all …]
/dports/science/py-cirq-core/Cirq-0.13.1/cirq-core/cirq/contrib/acquaintance/
H A Dbipartite_test.py20 import cirq.contrib.acquaintance as cca namespace
26 cca.BipartiteGraphType.COMPLETE,
35 cca.BipartiteGraphType.COMPLETE,
48 cca.BipartiteGraphType.COMPLETE,
65 cca.BipartiteGraphType.COMPLETE,
86 cca.BipartiteGraphType.MATCHING,
95 cca.BipartiteGraphType.MATCHING,
108 cca.BipartiteGraphType.MATCHING,
279 op.gate, (cca.AcquaintanceOpportunityGate, cca.SwapPermutationGate)
288 gate = cca.BipartiteSwapNetworkGate(cca.BipartiteGraphType.COMPLETE, 2)
[all …]
H A Dpermutation_test.py21 import cirq.contrib.acquaintance as cca namespace
28 gate = cca.SwapPermutationGate()
58 gate = cca.SwapPermutationGate()
63 gate = cca.SwapPermutationGate()
76 gate = cca.SwapPermutationGate()
252 circuit = cirq.Circuit([cca.SwapPermutationGate()(a, b), cca.SwapPermutationGate()(a, b)])
256 [cca.SwapPermutationGate(cirq.CZ)(a, b), cca.SwapPermutationGate(cirq.CZ)(a, b)]
261 [cca.SwapPermutationGate()(a, b), cca.SwapPermutationGate(cirq.CZ)(a, b)]
268 assert cca.SwapPermutationGate() == cca.SwapPermutationGate(cirq.SWAP)
269 assert cca.SwapPermutationGate() != cca.SwapPermutationGate(cirq.CZ)
[all …]
H A Dmutation_utils_test.py20 import cirq.contrib.acquaintance as cca namespace
27 _ = cca.complete_acquaintance_strategy(qubits, -1)
44 assert cca.get_acquaintance_size(trivial_strategy) == 1
47 op.gate, (cca.CircularShiftGate, cca.LinearPermutationGate)
139 assert cca.get_acquaintance_size(cubic_strategy) == 3
146 cca.rectify_acquaintance_strategy(cirq.Circuit())
148 perm_gate = cca.SwapPermutationGate()
151 cca.acquaint(*qubits[2:]),
152 cca.acquaint(*qubits[:2]),
157 cca.rectify_acquaintance_strategy(strategy)
[all …]
H A Dgates_test.py25 import cirq.contrib.acquaintance as cca namespace
30 repr(cca.AcquaintanceOpportunityGate(2))
80 no_decomp = lambda op: isinstance(op.gate, (cca.CircularShiftGate, cca.LinearPermutationGate))
187 cca.DECOMPOSE_PERMUTATION_GATES(circuit)
230 cca.SwapNetworkGate(())
232 cca.SwapNetworkGate((3,))
276 assert cca.get_acquaintance_size(op) == 0
279 op = cca.acquaint(*qubits[: s + 1])
286 assert cca.get_acquaintance_size(op) == 3
292 assert cca.get_acquaintance_size(op) == 0
[all …]
H A Dshift_test.py16 import cirq.contrib.acquaintance as cca namespace
20 g = cca.CircularShiftGate(4, 2)
24 g = cca.CircularShiftGate(4, 1, swap_gate=cirq.CZ)
30 equals_tester.add_equality_group(cca.CircularShiftGate(4, 1), cca.CircularShiftGate(4, 1))
32 equals_tester.add_equality_group(cca.CircularShiftGate(4, 2))
33 equals_tester.add_equality_group(cca.CircularShiftGate(3, 2))
45 g = cca.CircularShiftGate(3, 2)
53 circular_shift = cca.CircularShiftGate(2, 1, cirq.CZ)(*qubits[:2])
62 circular_shift = cca.CircularShiftGate(6, 3)(*qubits)
81 circular_shift = cca.CircularShiftGate(6, 2)(*qubits)
[all …]
/dports/science/py-cirq-aqt/Cirq-0.12.0/cirq-core/cirq/contrib/acquaintance/
H A Dbipartite_test.py20 import cirq.contrib.acquaintance as cca namespace
26 cca.BipartiteGraphType.COMPLETE,
35 cca.BipartiteGraphType.COMPLETE,
48 cca.BipartiteGraphType.COMPLETE,
65 cca.BipartiteGraphType.COMPLETE,
86 cca.BipartiteGraphType.MATCHING,
95 cca.BipartiteGraphType.MATCHING,
108 cca.BipartiteGraphType.MATCHING,
279 op.gate, (cca.AcquaintanceOpportunityGate, cca.SwapPermutationGate)
288 gate = cca.BipartiteSwapNetworkGate(cca.BipartiteGraphType.COMPLETE, 2)
[all …]
H A Dpermutation_test.py21 import cirq.contrib.acquaintance as cca namespace
28 gate = cca.SwapPermutationGate()
58 gate = cca.SwapPermutationGate()
63 gate = cca.SwapPermutationGate()
76 gate = cca.SwapPermutationGate()
252 circuit = cirq.Circuit([cca.SwapPermutationGate()(a, b), cca.SwapPermutationGate()(a, b)])
256 [cca.SwapPermutationGate(cirq.CZ)(a, b), cca.SwapPermutationGate(cirq.CZ)(a, b)]
261 [cca.SwapPermutationGate()(a, b), cca.SwapPermutationGate(cirq.CZ)(a, b)]
268 assert cca.SwapPermutationGate() == cca.SwapPermutationGate(cirq.SWAP)
269 assert cca.SwapPermutationGate() != cca.SwapPermutationGate(cirq.CZ)
[all …]
H A Dmutation_utils_test.py20 import cirq.contrib.acquaintance as cca namespace
27 _ = cca.complete_acquaintance_strategy(qubits, -1)
44 assert cca.get_acquaintance_size(trivial_strategy) == 1
47 op.gate, (cca.CircularShiftGate, cca.LinearPermutationGate)
139 assert cca.get_acquaintance_size(cubic_strategy) == 3
146 cca.rectify_acquaintance_strategy(cirq.Circuit())
148 perm_gate = cca.SwapPermutationGate()
151 cca.acquaint(*qubits[2:]),
152 cca.acquaint(*qubits[:2]),
157 cca.rectify_acquaintance_strategy(strategy)
[all …]
H A Dgates_test.py25 import cirq.contrib.acquaintance as cca namespace
30 repr(cca.AcquaintanceOpportunityGate(2))
80 no_decomp = lambda op: isinstance(op.gate, (cca.CircularShiftGate, cca.LinearPermutationGate))
187 cca.DECOMPOSE_PERMUTATION_GATES(circuit)
230 cca.SwapNetworkGate(())
232 cca.SwapNetworkGate((3,))
275 assert cca.get_acquaintance_size(op) == 0
278 op = cca.acquaint(*qubits[: s + 1])
285 assert cca.get_acquaintance_size(op) == 3
291 assert cca.get_acquaintance_size(op) == 0
[all …]
/dports/science/py-cirq-pasqal/Cirq-0.13.1/cirq-core/cirq/contrib/acquaintance/
H A Dbipartite_test.py20 import cirq.contrib.acquaintance as cca namespace
26 cca.BipartiteGraphType.COMPLETE,
35 cca.BipartiteGraphType.COMPLETE,
48 cca.BipartiteGraphType.COMPLETE,
65 cca.BipartiteGraphType.COMPLETE,
86 cca.BipartiteGraphType.MATCHING,
95 cca.BipartiteGraphType.MATCHING,
108 cca.BipartiteGraphType.MATCHING,
279 op.gate, (cca.AcquaintanceOpportunityGate, cca.SwapPermutationGate)
288 gate = cca.BipartiteSwapNetworkGate(cca.BipartiteGraphType.COMPLETE, 2)
[all …]
H A Dpermutation_test.py21 import cirq.contrib.acquaintance as cca namespace
28 gate = cca.SwapPermutationGate()
58 gate = cca.SwapPermutationGate()
63 gate = cca.SwapPermutationGate()
76 gate = cca.SwapPermutationGate()
252 circuit = cirq.Circuit([cca.SwapPermutationGate()(a, b), cca.SwapPermutationGate()(a, b)])
256 [cca.SwapPermutationGate(cirq.CZ)(a, b), cca.SwapPermutationGate(cirq.CZ)(a, b)]
261 [cca.SwapPermutationGate()(a, b), cca.SwapPermutationGate(cirq.CZ)(a, b)]
268 assert cca.SwapPermutationGate() == cca.SwapPermutationGate(cirq.SWAP)
269 assert cca.SwapPermutationGate() != cca.SwapPermutationGate(cirq.CZ)
[all …]
H A Dmutation_utils_test.py20 import cirq.contrib.acquaintance as cca namespace
27 _ = cca.complete_acquaintance_strategy(qubits, -1)
44 assert cca.get_acquaintance_size(trivial_strategy) == 1
47 op.gate, (cca.CircularShiftGate, cca.LinearPermutationGate)
139 assert cca.get_acquaintance_size(cubic_strategy) == 3
146 cca.rectify_acquaintance_strategy(cirq.Circuit())
148 perm_gate = cca.SwapPermutationGate()
151 cca.acquaint(*qubits[2:]),
152 cca.acquaint(*qubits[:2]),
157 cca.rectify_acquaintance_strategy(strategy)
[all …]
H A Dgates_test.py25 import cirq.contrib.acquaintance as cca namespace
30 repr(cca.AcquaintanceOpportunityGate(2))
80 no_decomp = lambda op: isinstance(op.gate, (cca.CircularShiftGate, cca.LinearPermutationGate))
187 cca.DECOMPOSE_PERMUTATION_GATES(circuit)
230 cca.SwapNetworkGate(())
232 cca.SwapNetworkGate((3,))
276 assert cca.get_acquaintance_size(op) == 0
279 op = cca.acquaint(*qubits[: s + 1])
286 assert cca.get_acquaintance_size(op) == 3
292 assert cca.get_acquaintance_size(op) == 0
[all …]
H A Dshift_test.py16 import cirq.contrib.acquaintance as cca namespace
20 g = cca.CircularShiftGate(4, 2)
24 g = cca.CircularShiftGate(4, 1, swap_gate=cirq.CZ)
30 equals_tester.add_equality_group(cca.CircularShiftGate(4, 1), cca.CircularShiftGate(4, 1))
32 equals_tester.add_equality_group(cca.CircularShiftGate(4, 2))
33 equals_tester.add_equality_group(cca.CircularShiftGate(3, 2))
45 g = cca.CircularShiftGate(3, 2)
53 circular_shift = cca.CircularShiftGate(2, 1, cirq.CZ)(*qubits[:2])
62 circular_shift = cca.CircularShiftGate(6, 3)(*qubits)
81 circular_shift = cca.CircularShiftGate(6, 2)(*qubits)
[all …]
/dports/science/py-cirq-google/Cirq-0.13.0/cirq-core/cirq/contrib/acquaintance/
H A Dbipartite_test.py20 import cirq.contrib.acquaintance as cca namespace
26 cca.BipartiteGraphType.COMPLETE,
35 cca.BipartiteGraphType.COMPLETE,
48 cca.BipartiteGraphType.COMPLETE,
65 cca.BipartiteGraphType.COMPLETE,
86 cca.BipartiteGraphType.MATCHING,
95 cca.BipartiteGraphType.MATCHING,
108 cca.BipartiteGraphType.MATCHING,
279 op.gate, (cca.AcquaintanceOpportunityGate, cca.SwapPermutationGate)
288 gate = cca.BipartiteSwapNetworkGate(cca.BipartiteGraphType.COMPLETE, 2)
[all …]
H A Dpermutation_test.py21 import cirq.contrib.acquaintance as cca namespace
28 gate = cca.SwapPermutationGate()
58 gate = cca.SwapPermutationGate()
63 gate = cca.SwapPermutationGate()
76 gate = cca.SwapPermutationGate()
252 circuit = cirq.Circuit([cca.SwapPermutationGate()(a, b), cca.SwapPermutationGate()(a, b)])
256 [cca.SwapPermutationGate(cirq.CZ)(a, b), cca.SwapPermutationGate(cirq.CZ)(a, b)]
261 [cca.SwapPermutationGate()(a, b), cca.SwapPermutationGate(cirq.CZ)(a, b)]
268 assert cca.SwapPermutationGate() == cca.SwapPermutationGate(cirq.SWAP)
269 assert cca.SwapPermutationGate() != cca.SwapPermutationGate(cirq.CZ)
[all …]
H A Dmutation_utils_test.py20 import cirq.contrib.acquaintance as cca namespace
27 _ = cca.complete_acquaintance_strategy(qubits, -1)
44 assert cca.get_acquaintance_size(trivial_strategy) == 1
47 op.gate, (cca.CircularShiftGate, cca.LinearPermutationGate)
139 assert cca.get_acquaintance_size(cubic_strategy) == 3
146 cca.rectify_acquaintance_strategy(cirq.Circuit())
148 perm_gate = cca.SwapPermutationGate()
151 cca.acquaint(*qubits[2:]),
152 cca.acquaint(*qubits[:2]),
157 cca.rectify_acquaintance_strategy(strategy)
[all …]
H A Dgates_test.py25 import cirq.contrib.acquaintance as cca namespace
30 repr(cca.AcquaintanceOpportunityGate(2))
80 no_decomp = lambda op: isinstance(op.gate, (cca.CircularShiftGate, cca.LinearPermutationGate))
187 cca.DECOMPOSE_PERMUTATION_GATES(circuit)
230 cca.SwapNetworkGate(())
232 cca.SwapNetworkGate((3,))
276 assert cca.get_acquaintance_size(op) == 0
279 op = cca.acquaint(*qubits[: s + 1])
286 assert cca.get_acquaintance_size(op) == 3
292 assert cca.get_acquaintance_size(op) == 0
[all …]
H A Dshift_test.py16 import cirq.contrib.acquaintance as cca namespace
20 g = cca.CircularShiftGate(4, 2)
24 g = cca.CircularShiftGate(4, 1, swap_gate=cirq.CZ)
30 equals_tester.add_equality_group(cca.CircularShiftGate(4, 1), cca.CircularShiftGate(4, 1))
32 equals_tester.add_equality_group(cca.CircularShiftGate(4, 2))
33 equals_tester.add_equality_group(cca.CircularShiftGate(3, 2))
45 g = cca.CircularShiftGate(3, 2)
53 circular_shift = cca.CircularShiftGate(2, 1, cirq.CZ)(*qubits[:2])
62 circular_shift = cca.CircularShiftGate(6, 3)(*qubits)
81 circular_shift = cca.CircularShiftGate(6, 2)(*qubits)
[all …]
/dports/science/py-cirq-ionq/Cirq-0.13.1/cirq-core/cirq/contrib/acquaintance/
H A Dbipartite_test.py20 import cirq.contrib.acquaintance as cca namespace
26 cca.BipartiteGraphType.COMPLETE,
35 cca.BipartiteGraphType.COMPLETE,
48 cca.BipartiteGraphType.COMPLETE,
65 cca.BipartiteGraphType.COMPLETE,
86 cca.BipartiteGraphType.MATCHING,
95 cca.BipartiteGraphType.MATCHING,
108 cca.BipartiteGraphType.MATCHING,
279 op.gate, (cca.AcquaintanceOpportunityGate, cca.SwapPermutationGate)
288 gate = cca.BipartiteSwapNetworkGate(cca.BipartiteGraphType.COMPLETE, 2)
[all …]
H A Dpermutation_test.py21 import cirq.contrib.acquaintance as cca namespace
28 gate = cca.SwapPermutationGate()
58 gate = cca.SwapPermutationGate()
63 gate = cca.SwapPermutationGate()
76 gate = cca.SwapPermutationGate()
252 circuit = cirq.Circuit([cca.SwapPermutationGate()(a, b), cca.SwapPermutationGate()(a, b)])
256 [cca.SwapPermutationGate(cirq.CZ)(a, b), cca.SwapPermutationGate(cirq.CZ)(a, b)]
261 [cca.SwapPermutationGate()(a, b), cca.SwapPermutationGate(cirq.CZ)(a, b)]
268 assert cca.SwapPermutationGate() == cca.SwapPermutationGate(cirq.SWAP)
269 assert cca.SwapPermutationGate() != cca.SwapPermutationGate(cirq.CZ)
[all …]
H A Dmutation_utils_test.py20 import cirq.contrib.acquaintance as cca namespace
27 _ = cca.complete_acquaintance_strategy(qubits, -1)
44 assert cca.get_acquaintance_size(trivial_strategy) == 1
47 op.gate, (cca.CircularShiftGate, cca.LinearPermutationGate)
139 assert cca.get_acquaintance_size(cubic_strategy) == 3
146 cca.rectify_acquaintance_strategy(cirq.Circuit())
148 perm_gate = cca.SwapPermutationGate()
151 cca.acquaint(*qubits[2:]),
152 cca.acquaint(*qubits[:2]),
157 cca.rectify_acquaintance_strategy(strategy)
[all …]
H A Dgates_test.py25 import cirq.contrib.acquaintance as cca namespace
30 repr(cca.AcquaintanceOpportunityGate(2))
80 no_decomp = lambda op: isinstance(op.gate, (cca.CircularShiftGate, cca.LinearPermutationGate))
187 cca.DECOMPOSE_PERMUTATION_GATES(circuit)
230 cca.SwapNetworkGate(())
232 cca.SwapNetworkGate((3,))
276 assert cca.get_acquaintance_size(op) == 0
279 op = cca.acquaint(*qubits[: s + 1])
286 assert cca.get_acquaintance_size(op) == 3
292 assert cca.get_acquaintance_size(op) == 0
[all …]
H A Dshift_test.py16 import cirq.contrib.acquaintance as cca namespace
20 g = cca.CircularShiftGate(4, 2)
24 g = cca.CircularShiftGate(4, 1, swap_gate=cirq.CZ)
30 equals_tester.add_equality_group(cca.CircularShiftGate(4, 1), cca.CircularShiftGate(4, 1))
32 equals_tester.add_equality_group(cca.CircularShiftGate(4, 2))
33 equals_tester.add_equality_group(cca.CircularShiftGate(3, 2))
45 g = cca.CircularShiftGate(3, 2)
53 circular_shift = cca.CircularShiftGate(2, 1, cirq.CZ)(*qubits[:2])
62 circular_shift = cca.CircularShiftGate(6, 3)(*qubits)
81 circular_shift = cca.CircularShiftGate(6, 2)(*qubits)
[all …]

12345678910>>...69