12 citations · 51 across the 10 of their papers we have counts for
13 papers
Ghost unitaries for loss-resilient photonic resource-state generation
Kevin J. Randles, Manuel H. Muñoz-Arias, Kevin Thompson
Entangled few-photon states, such as Bell and Greenberger-Horne-Zeilinger (GHZ) states, are central resources for discrete-variable photonic quantum information processing. In many…
Optimal Fusion Strategies for Quantum Computation
Kenneth Goodenough, Andrew Landahl, Joon Lee +2
Logical fusions are important for a number of tasks in quantum information, such as quantum error correction and quantum repeaters. In the photonic setting one must contend with th…
An SU(2)-symmetric Semidefinite Programming Hierarchy for Quantum Max Cut
Jun Takahashi, Chaithanya Rayudu, Cunlu Zhou +3
Understanding and approximating extremal energy states of local Hamiltonians is a central problem in quantum physics and complexity theory. Recent work has focused on developing ap…
Improved Approximations for Extremal Eigenvalues of Sparse Hamiltonians
Daniel Hothem, Ojas Parekh, Kevin Thompson
We give a classical -approximation for the maximum eigenvalue of a -sparse fermionic Hamiltonian with strictly -local terms, as well as a -approximation w…
An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms
Ojas Parekh, Kevin Thompson
We resolve the approximability of the maximum energy of the Quantum Max Cut (QMC) problem using product states. A classical 0.498-approximation, using a basic semidefinite programm…
Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality
Yeongwoo Hwang, Joe Neeman, Ojas Parekh +2
The Gaussian noise stability of a function is the expected value of over -correlated Gaussian random v…
Application of the Level- Quantum Lasserre Hierarchy in Quantum Approximation Algorithms
Ojas Parekh, Kevin Thompson
The Lasserre Hierarchy is a set of semidefinite programs which yield increasingly tight bounds on optimal solutions to many NP-hard optimization problems. The hierarchy is paramete…
Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems
Ojas Parekh, Kevin Thompson
The quantum k-Local Hamiltonian problem is a natural generalization of classical constraint satisfaction problems (k-CSP) and is complete for QMA, a quantum analog of NP. Although…
When is a bit worth much more than kT ln2?
Can Gokler, Artemy Kolchinsky, Zi-Wen Liu +6
Physical processes thatobtain, process, and erase information involve tradeoffs between information and energy. The fundamental energetic value of a bit of information exchanged wi…
Maximizing free energy gain
Artemy Kolchinsky, Iman Marvian, Can Gokler +6
Maximizing the amount of work harvested from an environment is important for a wide variety of biological and technological processes, from energy-harvesting processes such as phot…
polylog-LDPC Capacity Achieving Codes for the Noisy Quantum Erasure Channel
Seth Lloyd, Peter Shor, Kevin Thompson
We provide sparse quantum codes for correcting the erasure channel arbitrarily close to the capacity. Specifically, we provide quantum stabilizer codes tha…
The Need for Structure in Quantum LDPC Codes
Lior Eldar, Maris Ozols, Kevin F. Thompson
Existence of quantum low-density parity-check (LDPC) codes whose minimal distance scales linearly with the number of qubits is a major open problem in quantum information. Its prac…
Efficiently Controllable Graphs
Can Gokler, Seth Lloyd, Peter Shor +1
We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by…