cirq.contrib.acquaintance.complete_acquaintance_strategy
Returns an acquaintance strategy with can handle the given number of qubits.
cirq.contrib.acquaintance.complete_acquaintance_strategy(
qubit_order: Sequence[cirq.Qid],
acquaintance_size: int = 0,
swap_gate: cirq.Gate = cirq.SWAP
) -> cirq.Circuit
Args |
|---|
qubit_order
|
The qubits on which the strategy should be defined.
|
acquaintance_size
|
The maximum number of qubits to be acted on by
an operation.
|
swap_gate
|
The gate used to swap logical indices.
|
Returns |
|---|
|
A circuit capable of implementing any set of k-local operations.
|
Raises |
|---|
ValueError
|
If acquaintance_size is negative.
|
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2025-04-15 UTC.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2025-04-15 UTC."],[],[]]
View source on GitHub