1 citations · 1 across the 6 of their papers we have counts for
9 papers
Improved classical optimization of fermionic Hamiltonians beyond Gaussian states
Ojas Parekh
We give a polynomial-time randomized classical algorithm that approximates the largest eigenvalue of a traceless quartic fermionic Hamiltonian on modes. The algo…
Polynomial-time classical and quantum simulation of quantum impurity models
Jiaqing Jiang, Nathan Ju, Ojas Parekh +2
Quantum impurity models are paradigmatic models of interacting quantum matter, as well as key computational primitives for modern electronic-structure methods. They describe a smal…
Optimal testing of fermionic and bosonic Gaussian states
Vishnu Iyer, Bryan O'Gorman, Ojas Parekh +2
We study the problem of property testing quantum states: given a pure state that either (A) belongs to some class of pure states, or (B) is -far in tra…
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…
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…
How to Design a Quantum Streaming Algorithm Without Knowing Anything About Quantum Computing
John Kallaugher, Ojas Parekh, Nadezhda Voronova
A series of work [GKK+08, Kal22, KPV24] has shown that asymptotic advantages in space complexity are possible for quantum algorithms over their classical counterparts in the stream…
Constrained local Hamiltonians: quantum generalizations of Vertex Cover
Ojas Parekh, Chaithanya Rayudu, Kevin Thompson
Recent successes in producing rigorous approximation algorithms for local Hamiltonian problems such as Quantum Max Cut have exploited connections to unconstrained classical discret…
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…
Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model
John Kallaugher, Ojas Parekh, Nadezhda Voronova
While the search for quantum advantage typically focuses on speedups in execution time, quantum algorithms also offer the potential for advantage in space complexity. Previous work…