Skip to content

Katie #4

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
katiejones404 wants to merge 17 commits into
base: main
Choose a base branch
from
Open

Katie #4

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
17 commits
Select commit Hold shift + click to select a range
1ed5fb9
Energy Comparison Test
emmawilmott63 Jan 31, 2026
10455ac
Symmetry Validator
katiejones404 Jan 31, 2026
251b3ee
Merge branch 'main' of https://github.com/katiejones404/2026-NVIDIA-M…
katiejones404 Jan 31, 2026
80ea5ee
excerise 3
Rebecca922 Jan 31, 2026
803566a
Updated energy function
katiejones404 Jan 31, 2026
92d46eb
Merge branch 'main' of https://github.com/katiejones404/2026-NVIDIA-M…
katiejones404 Jan 31, 2026
5c35b2b
exercise 2
Siryouka Jan 31, 2026
9e8efd0
exercise 4
Siryouka Jan 31, 2026
53459c2
sanitation
Siryouka Jan 31, 2026
9bf3064
sym update before integration with exercises
katiejones404 Jan 31, 2026
9549ea6
Merge branch 'main' of https://github.com/katiejones404/2026-NVIDIA-M…
katiejones404 Jan 31, 2026
9f8c9d6
ex3 update + ex 5
Rebecca922 Jan 31, 2026
6ba49ec
Merge branch 'main' of https://github.com/katiejones404/2026-NVIDIA-M…
katiejones404 Jan 31, 2026
336b78d
Validation in exercises
katiejones404 Jan 31, 2026
85a5ad1
all ex
Rebecca922 Jan 31, 2026
bc3f4c7
new validation file
katiejones404 Feb 1, 2026
acd7d99
test commit
katiejones404 Feb 1, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
180 changes: 180 additions & 0 deletions team-submissions/SV.ipynb
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,180 @@
{
"cells": [
{
"cell_type": "code",
"execution_count": 15,
"id": "884e5b8d",
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"N= 10 best energy= 13 count= 40\n",
"[1, 1, 1, 1, 1, -1, -1, 1, -1, 1]\n",
"[1, 1, 1, 1, -1, 1, -1, -1, 1, 1]\n",
"[1, 1, 1, 1, -1, -1, 1, 1, -1, 1]\n",
"[1, 1, 1, 1, -1, -1, 1, -1, 1, -1]\n",
"[1, 1, 1, -1, 1, -1, 1, 1, -1, -1]\n",
"[1, 1, 1, -1, -1, 1, 1, -1, 1, -1]\n",
"[1, 1, 1, -1, -1, -1, 1, -1, -1, 1]\n",
"[1, 1, -1, -1, 1, -1, 1, 1, 1, 1]\n",
"[1, 1, -1, -1, 1, -1, 1, -1, -1, -1]\n",
"[1, 1, -1, -1, -1, 1, -1, -1, 1, -1]\n",
"[1, -1, 1, 1, 1, 1, 1, -1, -1, 1]\n",
"[1, -1, 1, 1, -1, 1, 1, 1, -1, -1]\n",
"[1, -1, 1, 1, -1, -1, 1, 1, 1, 1]\n",
"[1, -1, 1, -1, 1, 1, -1, -1, -1, -1]\n",
"[1, -1, 1, -1, -1, 1, 1, 1, 1, 1]\n",
"[1, -1, 1, -1, -1, 1, 1, -1, -1, -1]\n",
"[1, -1, 1, -1, -1, -1, -1, 1, 1, -1]\n",
"[1, -1, -1, 1, 1, 1, 1, 1, -1, 1]\n",
"[1, -1, -1, 1, 1, 1, 1, -1, 1, -1]\n",
"[1, -1, -1, 1, -1, -1, -1, 1, 1, 1]\n",
"[-1, 1, 1, -1, 1, 1, 1, -1, -1, -1]\n",
"[-1, 1, 1, -1, -1, -1, -1, 1, -1, 1]\n",
"[-1, 1, 1, -1, -1, -1, -1, -1, 1, -1]\n",
"[-1, 1, -1, 1, 1, 1, 1, -1, -1, 1]\n",
"[-1, 1, -1, 1, 1, -1, -1, 1, 1, 1]\n",
"[-1, 1, -1, 1, 1, -1, -1, -1, -1, -1]\n",
"[-1, 1, -1, 1, -1, -1, 1, 1, 1, 1]\n",
"[-1, 1, -1, -1, 1, 1, -1, -1, -1, -1]\n",
"[-1, 1, -1, -1, 1, -1, -1, -1, 1, 1]\n",
"[-1, 1, -1, -1, -1, -1, -1, 1, 1, -1]\n",
"[-1, -1, 1, 1, 1, -1, 1, 1, -1, 1]\n",
"[-1, -1, 1, 1, -1, 1, -1, 1, 1, 1]\n",
"[-1, -1, 1, 1, -1, 1, -1, -1, -1, -1]\n",
"[-1, -1, -1, 1, 1, 1, -1, 1, 1, -1]\n",
"[-1, -1, -1, 1, 1, -1, -1, 1, -1, 1]\n",
"[-1, -1, -1, 1, -1, 1, -1, -1, 1, 1]\n",
"[-1, -1, -1, -1, 1, 1, -1, 1, -1, 1]\n",
"[-1, -1, -1, -1, 1, 1, -1, -1, 1, -1]\n",
"[-1, -1, -1, -1, 1, -1, 1, 1, -1, -1]\n",
"[-1, -1, -1, -1, -1, 1, 1, -1, 1, -1]\n"
]
}
],
"source": [
"from itertools import product\n",
"\n",
"def C_k(s, k):\n",
" N = len(s)\n",
" total = 0\n",
" for i in range(N - k):\n",
" total += s[i] * s[i + k]\n",
" return total\n",
"\n",
"def E(s):\n",
" N = len(s)\n",
" total = 0\n",
" for k in range(1, N):\n",
" ck = C_k(s, k)\n",
" total += ck * ck\n",
" return total\n",
"\n",
"def brute_force_sequences(N):\n",
" # generator that yields (seq_list, energy)\n",
" for seq in product([1, -1], repeat=N):\n",
" seq_list = list(seq)\n",
" yield seq_list, E(seq_list)\n",
"\n",
"def calculate(N):\n",
" best_energy = None\n",
" best_seqs = []\n",
" for seq, energy in brute_force_sequences(N):\n",
" if best_energy is None or energy < best_energy:\n",
" best_energy = energy\n",
" best_seqs = [seq]\n",
" elif energy == best_energy:\n",
" best_seqs.append(seq)\n",
" return best_energy, best_seqs\n",
"\n",
"# Example usage:\n",
"if __name__ == \"__main__\":\n",
" N = 10\n",
" best_energy, best_seqs = calculate(N)\n",
" print(\"N=\", N, \"best energy=\", best_energy, \"count=\", len(best_seqs))\n",
" for seq in best_seqs:\n",
" print(seq)\n"
]
},
{
"cell_type": "code",
"execution_count": 2,
"id": "1917fa7f",
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"Optimal Energy: 13\n",
"Number of Optimal Sequences: 40\n",
"Optimal Sequence: [1, 1, 1, 1, 1, -1, -1, 1, -1, 1]\n",
"Optimal Sequence: [1, 1, 1, 1, -1, 1, -1, -1, 1, 1]\n",
"Optimal Sequence: [1, 1, 1, 1, -1, -1, 1, 1, -1, 1]\n",
"Optimal Sequence: [1, 1, 1, 1, -1, -1, 1, -1, 1, -1]\n",
"Optimal Sequence: [1, 1, 1, -1, 1, -1, 1, 1, -1, -1]\n",
"Optimal Sequence: [1, 1, 1, -1, -1, 1, 1, -1, 1, -1]\n",
"Optimal Sequence: [1, 1, 1, -1, -1, -1, 1, -1, -1, 1]\n",
"Optimal Sequence: [1, 1, -1, -1, 1, -1, 1, 1, 1, 1]\n",
"Optimal Sequence: [1, 1, -1, -1, 1, -1, 1, -1, -1, -1]\n",
"Optimal Sequence: [1, 1, -1, -1, -1, 1, -1, -1, 1, -1]\n",
"Optimal Sequence: [1, -1, 1, 1, 1, 1, 1, -1, -1, 1]\n",
"Optimal Sequence: [1, -1, 1, 1, -1, 1, 1, 1, -1, -1]\n",
"Optimal Sequence: [1, -1, 1, 1, -1, -1, 1, 1, 1, 1]\n",
"Optimal Sequence: [1, -1, 1, -1, 1, 1, -1, -1, -1, -1]\n",
"Optimal Sequence: [1, -1, 1, -1, -1, 1, 1, 1, 1, 1]\n",
"Optimal Sequence: [1, -1, 1, -1, -1, 1, 1, -1, -1, -1]\n",
"Optimal Sequence: [1, -1, 1, -1, -1, -1, -1, 1, 1, -1]\n",
"Optimal Sequence: [1, -1, -1, 1, 1, 1, 1, 1, -1, 1]\n",
"Optimal Sequence: [1, -1, -1, 1, 1, 1, 1, -1, 1, -1]\n",
"Optimal Sequence: [1, -1, -1, 1, -1, -1, -1, 1, 1, 1]\n",
"Optimal Sequence: [-1, 1, 1, -1, 1, 1, 1, -1, -1, -1]\n",
"Optimal Sequence: [-1, 1, 1, -1, -1, -1, -1, 1, -1, 1]\n",
"Optimal Sequence: [-1, 1, 1, -1, -1, -1, -1, -1, 1, -1]\n",
"Optimal Sequence: [-1, 1, -1, 1, 1, 1, 1, -1, -1, 1]\n",
"Optimal Sequence: [-1, 1, -1, 1, 1, -1, -1, 1, 1, 1]\n",
"Optimal Sequence: [-1, 1, -1, 1, 1, -1, -1, -1, -1, -1]\n",
"Optimal Sequence: [-1, 1, -1, 1, -1, -1, 1, 1, 1, 1]\n",
"Optimal Sequence: [-1, 1, -1, -1, 1, 1, -1, -1, -1, -1]\n",
"Optimal Sequence: [-1, 1, -1, -1, 1, -1, -1, -1, 1, 1]\n",
"Optimal Sequence: [-1, 1, -1, -1, -1, -1, -1, 1, 1, -1]\n",
"Optimal Sequence: [-1, -1, 1, 1, 1, -1, 1, 1, -1, 1]\n",
"Optimal Sequence: [-1, -1, 1, 1, -1, 1, -1, 1, 1, 1]\n",
"Optimal Sequence: [-1, -1, 1, 1, -1, 1, -1, -1, -1, -1]\n",
"Optimal Sequence: [-1, -1, -1, 1, 1, 1, -1, 1, 1, -1]\n",
"Optimal Sequence: [-1, -1, -1, 1, 1, -1, -1, 1, -1, 1]\n",
"Optimal Sequence: [-1, -1, -1, 1, -1, 1, -1, -1, 1, 1]\n",
"Optimal Sequence: [-1, -1, -1, -1, 1, 1, -1, 1, -1, 1]\n",
"Optimal Sequence: [-1, -1, -1, -1, 1, 1, -1, -1, 1, -1]\n",
"Optimal Sequence: [-1, -1, -1, -1, 1, -1, 1, 1, -1, -1]\n",
"Optimal Sequence: [-1, -1, -1, -1, -1, 1, 1, -1, 1, -1]\n"
]
}
],
"source": []
}
],
"metadata": {
"kernelspec": {
"display_name": "base",
"language": "python",
"name": "python3"
},
"language_info": {
"codemirror_mode": {
"name": "ipython",
"version": 3
},
"file_extension": ".py",
"mimetype": "text/x-python",
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.12.7"
}
},
"nbformat": 4,
"nbformat_minor": 5
}
136 changes: 136 additions & 0 deletions team-submissions/symValidator.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,136 @@
'''“We verify correctness by (a) exact enumeration for small N,
(b) symmetry tests mandated by the LABS Hamiltonian (global spin-flip,
reversal, and their combination),
and (c) cross-checks between classical MTS and the
quantum algorithm on small instances.
This mirrors standard practice in quantum-classical algorithm validation where
invariants and small-instance exact checks are used as the ground-truth proxy
when a solution key is not available.” '''
# symValidator.py
#LABS energy function (canonical)
import numpy as np

def labs_energy(s):
"""Compute LABS energy for a sequence s of +/-1 (list or 1D numpy array)."""
s = np.asarray(s, dtype=int)
N = s.size
E = 0
for k in range(1, N):
Ck = int(np.sum(s[:N-k] * s[k:])) # autocorrelation at shift k
E += Ck * Ck
return int(E)


# brute force enumeration for small N
import itertools

def brute_force_labs(N):
energies = {}
for bits in itertools.product([-1, 1], repeat=N):
energies[bits] = labs_energy(bits)
# return sorted list of (sequence, energy)
return sorted(energies.items(), key=lambda t: t[1])


# symmetry positive tests (must pass)
def test_global_flip(s):
assert labs_energy(s) == labs_energy([-x for x in s]), "Global flip symmetry failed"

def test_reversal(s):
assert labs_energy(s) == labs_energy(list(reversed(s))), "Reversal symmetry failed"

def test_flip_and_reverse(s):
assert labs_energy(s) == labs_energy([-x for x in reversed(s)]), "Flip+reverse symmetry failed"

# test on random and canonical sequences
import random
#negative tests to catch incorrect assumptions (eg, accidental cyclic autocor)
def cyclic_rotate(s, r):
"""Cyclic rotate right by r"""
r = r % len(s)
return s[-r:] + s[:-r]

# cross-check classical vs quantum (small N)
# integrate after phase 1 is completed
'''def compare_solvers(N):
bf = brute_force_labs(N)
best_exact_e = bf[0][1]
# run MTS (classical baseline) - placeholder: use your notebook's MTS call
mts_seq, mts_e = run_MTS(N) # must return (sequence, energy)
# run quantum procedure (placeholder)
q_seq, q_e = run_quantum(N) # must return (sequence, energy)
print(f"N={N}: exact={best_exact_e}, MTS={mts_e}, Quantum={q_e}")
return best_exact_e, mts_e, q_e

# Example call (only for N small where brute force is available)
N = 6
compare_solvers(N)
'''

# build orbit under dihedral-like ops
def dihedral_orbit(s):
#the 'shape' is a 1D sequence, so we can't use rotations
s = list(s)
ops = [
lambda x: x,
lambda x: [-a for a in x], # flip
lambda x: list(reversed(x)), # reverse
lambda x: [-a for a in reversed(x)] # flip+reverse
]
return {tuple(op(s)) for op in ops}


# CELL: small test suite runner
def run_all_tests():
# smoke tests for small Ns using brute force sequences
for N in range(3,7):
print(f"Testing all symmetries on all {2**N} sequences for N={N}")
bf = brute_force_labs(N)
for seq, e in bf:
test_global_flip(seq)
test_reversal(seq)
test_flip_and_reverse(seq)
# negative test sample
s = [1, -1, 1, 1, -1, 1]
assert labs_energy(s) != labs_energy(cyclic_rotate(s, 1))
print("All tests passed.")

# Run the tests
if __name__ == "__main__":
# run for N=5
N = 5
bf = brute_force_labs(N)
print(f"Found {len(bf)} sequences; best energy = {bf[0][1]}")
# show top few
for seq, e in bf[:6]:
print(seq, e)

# symmetry smoke tests on random sequences
for N in [3, 4, 5, 6]:
for _ in range(10):
s = [random.choice([-1, 1]) for _ in range(N)]
test_global_flip(s)
test_reversal(s)
test_flip_and_reverse(s)
print("Positive symmetry tests passed on random samples.")

# pick a random sequence and check rotation changes energy (for linear LABS)
s = [1, -1, 1, 1, -1] # example
E_orig = labs_energy(s)
E_rot = labs_energy(cyclic_rotate(s, 1))
print("orig:", s, "E=", E_orig, "rotated E=", E_rot)
assert E_orig != E_rot, (
"Rotation did not change energy check whether you accidentally implemented circular autocor!"
)

# dihedral orbit demo
s = [1, -1, 1, 1]
# get all transformations
orbit = dihedral_orbit(s)
print("orbit size:", len(orbit))
# print energy, should be the same
for seq in orbit:
print(seq, labs_energy(seq))

# Run the tests
run_all_tests()
Loading