Ejemplos de LargestAreaGreedySequenceSearch._choose_next_qubit en Python

Ejemplo n.º 1

def test_largest_sequence_search_does_not_use_used():
    q00 = GridQubit(0, 0)
    q10 = GridQubit(1, 0)
    q20 = GridQubit(2, 0)
    q21 = GridQubit(2, 1)
    qubits = [q00, q10, q20, q21]
    search = LargestAreaGreedySequenceSearch(_create_device(qubits), q10)
    # +-* X
    #
    #     +
    assert search._choose_next_qubit(q10, {q10, q20}) == q00

Ejemplo n.º 2

Archivo: greedy_test.py Proyecto: google2013/Cirq

def test_largest_sequence_search_does_not_use_used():
    q00 = GridQubit(0, 0)
    q10 = GridQubit(1, 0)
    q20 = GridQubit(2, 0)
    q21 = GridQubit(2, 1)
    qubits = [q00, q10, q20, q21]
    search = LargestAreaGreedySequenceSearch(_create_device(qubits), q10)
    # +-* X
    #
    #     +
    assert search._choose_next_qubit(q10, {q10, q20}) == q00

Ejemplo n.º 3

def test_largest_sequence_search_chooses_largest():
    q00 = XmonQubit(0, 0)
    q10 = XmonQubit(1, 0)
    q20 = XmonQubit(2, 0)
    q21 = XmonQubit(2, 1)
    qubits = [q00, q10, q20, q21]
    search = LargestAreaGreedySequenceSearch(_create_device(qubits), q10)
    # + *-+
    #
    #     +
    assert search._choose_next_qubit(q10, {q10}) == q20

Ejemplo n.º 4

def test_largest_sequence_search_traverses_grid():
    q00 = GridQubit(0, 0)
    q10 = GridQubit(1, 0)
    q11 = GridQubit(1, 1)
    q20 = GridQubit(2, 0)
    q30 = GridQubit(3, 0)
    q40 = GridQubit(4, 0)
    q41 = GridQubit(4, 1)
    q42 = GridQubit(4, 2)
    q50 = GridQubit(5, 0)
    qubits = [q00, q10, q11, q20, q30, q40, q50, q41, q42]
    search = LargestAreaGreedySequenceSearch(_create_device(qubits), q20)
    # + + +-+-+ +
    #         |
    #   +     +
    #         |
    #         +
    assert search._choose_next_qubit(q20, {q20}) == q30
    assert search._choose_next_qubit(q30, {q20, q30}) == q40
    assert search._choose_next_qubit(q40, {q20, q30, q40}) == q41
    assert search._choose_next_qubit(q41, {q20, q30, q40, q41}) == q42
    assert search._choose_next_qubit(q42, {q20, q30, q40, q41, q42}) is None

Ejemplo n.º 5

Archivo: greedy_test.py Proyecto: google2013/Cirq

def test_largest_sequence_search_traverses_grid():
    q00 = GridQubit(0, 0)
    q10 = GridQubit(1, 0)
    q11 = GridQubit(1, 1)
    q20 = GridQubit(2, 0)
    q30 = GridQubit(3, 0)
    q40 = GridQubit(4, 0)
    q41 = GridQubit(4, 1)
    q42 = GridQubit(4, 2)
    q50 = GridQubit(5, 0)
    qubits = [q00, q10, q11, q20, q30, q40, q50, q41, q42]
    search = LargestAreaGreedySequenceSearch(_create_device(qubits), q20)
    # + + +-+-+ +
    #         |
    #   +     +
    #         |
    #         +
    assert search._choose_next_qubit(q20, {q20}) == q30
    assert search._choose_next_qubit(q30, {q20, q30}) == q40
    assert search._choose_next_qubit(q40, {q20, q30, q40}) == q41
    assert search._choose_next_qubit(q41, {q20, q30, q40, q41}) == q42
    assert search._choose_next_qubit(q42, {q20, q30, q40, q41, q42}) is None