21 citations · 57 across the 14 of their papers we have counts for
12 papers · 1 filter
Blind Quantum Computation with a Small Quantum Server
Daniel Lovsted, Filipa C. R. Peres, Joshua Nevin +2
Blind quantum computation (BQC) allows low-resource clients to securely delegate computations to a quantum server, but server resource costs scale with the computation size, posing…
Double categories for adaptive quantum computation
Cihan Okay, Walker Stern, Redi Haderi +1
Quantum computation admits several models that emphasize different computational primitives and forms of classical control. We develop a unified double categorical framework for de…
Phase space tableau simulation for quantum computation
Selman Ipek, Atak Talay Yucel, Farzad Shahi +2
We introduce a novel tableau-based classical simulation method for quantum computation, formulated within the phase space framework of the extended stabilizer theory of closed non-…
Classical simulation of universal measurement-based quantum computation using multipartite Bell scenarios
Cihan Okay, Atak Talay Yucel, Selman Ipek
We introduce a novel classical simulation algorithm based on non-signaling polytopes of multipartite Bell scenarios, capable of simulating universal measurement-based quantum compu…
Extremal simplicial distributions on cycle scenarios with arbitrary outcomes
Aziz Kharoof, Cihan Okay, Selman Ipek
Cycle scenarios are a significant class of contextuality scenarios, with the Clauser-Horne-Shimony-Holt (CHSH) scenario being a notable example. While binary outcome measurements i…
The degenerate vertices of the -qubit -polytope and their update rules
Selman Ipek, Cihan Okay
Recently, a class of objects, known as -polytopes, were introduced for classically simulating universal quantum computation with magic states. In -simulation, the probabilist…