3 papers
quant-ph2026
Fermionic Insights into Measurement-Based Quantum Computation: Circle Graph States Are Not Universal Resources
Brent Harrison, Vishnu Iyer, Ojas Parekh +2
Measurement-based quantum computation (MBQC) is a strong contender for realizing quantum computers. A critical question for MBQC is the identification of resource graph states that…
quant-ph2025
Complexity Classification of Product State Problems for Local Hamiltonians
John Kallaugher, Ojas Parekh, Kevin Thompson +2
Product states, unentangled tensor products of single qubits, are a ubiquitous ansatz in quantum computation, including for state-of-the-art Hamiltonian approximation algorithms. A…
quant-ph2024
Second order cone relaxations for quantum Max Cut
Felix Huber, Kevin Thompson, Ojas Parekh +1
Quantum Max Cut (QMC), also known as the quantum anti-ferromagnetic Heisenberg model, is a QMA-complete problem relevant to quantum many-body physics and computer science. Semidefi…