8 citations · 28 across the 39 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2002
The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems
V. Arvind, Rainer Schuler
We first give an quantum algorithm for the 0-1 Knapsack problem with variables. More generally, for 0-1 Integer Linear Programs with variables and inequali…
quant-ph2002★ 1 cited
Nonstabilizer Quantum Codes from Abelian Subgroups of the Error Group
V. Arvind, Piyush P Kurur, K. R. Parthasarathy
This paper is motivated by the computer-generated nonadditive ((5,6,2)) code described in an article by Rains, Hardin, Shor and Sloane. We describe a theory of non-stabilizer codes…
quant-ph2002
A Family of Quantum Stabilizer Codes Based on the Weyl Commutation Relations over a Finite Field
V. Arvind, K. R. Parthasarathy
Using the Weyl commutation relations over a finite field we introduce a family of error-correcting quantum stabilizer codes based on a class of symmetric matrices over the finite f…