Hidden translation and orbit coset in quantum computing
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Quantum zero-error algorithms cannot be composed
Information Processing Letters
An Explicit Universal Gate-Set for Exchange-Only Quantum Computation
Quantum Information Processing
Classical and quantum function reconstruction via character evaluation
Journal of Complexity - Special issue on coding and cryptography
On the complexity of simulating space-bounded quantum computations
Computational Complexity
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Quantum Information Processing
Quantum algorithms for the triangle problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
A Binding Procedure for Distributed Binary Data Representations
Cybernetics and Systems Analysis
Quantum and classical tradeoffs
Theoretical Computer Science
A randomized stochastic optimization algorithm: Its estimation accuracy
Automation and Remote Control
Zero-knowledge against quantum attacks
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Zeno machines and hypercomputation
Theoretical Computer Science
Classically controlled quantum computation
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Revisiting a limit on efficient quantum computation
Proceedings of the 44th annual Southeast regional conference
Toward a general theory of quantum games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Quantum algorithms for Simon's problem over general groups
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Universality and programmability of quantum computers
Theoretical Computer Science
Quadratic Form Expansions for Unitaries
Theory of Quantum Computation, Communication, and Cryptography
The detectability lemma and quantum gap amplification
Proceedings of the forty-first annual ACM symposium on Theory of computing
Efficient Quantum Tensor Product Expanders and k-Designs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Quantum algorithms for Simon's problem over nonabelian groups
ACM Transactions on Algorithms (TALG)
Classically-controlled Quantum Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Problems and prospects for quantum computational speed-up
ICCS'03 Proceedings of the 2003 international conference on Computational science
General properties of quantum zero-knowledge proofs
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Adiabatic quantum counting by geometric phase estimation
Quantum Information Processing
An improved lower bound on query complexity for quantum PAC learning
Information Processing Letters
Mathematical Structures in Computer Science
An improvement of key generation algorithm for Gentry's homomorphic encryption scheme
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Experimentally feasible measures of distance between quantum operations
Quantum Information Processing
Programmable Hamiltonian for One-way Patterns
Electronic Notes in Theoretical Computer Science (ENTCS)
Testing non-isometry is QMA-complete
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
Any AND-OR Formula of Size $N$ Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
SIAM Journal on Computing
Quantum Computation and the Evaluation of Tensor Networks
SIAM Journal on Computing
A promiseBQP-complete string rewriting problem
Quantum Information & Computation
Simplifying quantum double hamiltonians using perturbative gadgets
Quantum Information & Computation
Quantum Information & Computation
On the complexity of approximating the diamond norm
Quantum Information & Computation
Quantum Information & Computation
Computational distinguishability of degradable and antidegradable channels
Quantum Information & Computation
Both Toffoli and controlled-NOT need little help to do universal quantum computing
Quantum Information & Computation
3-local Hamitonian is QMA-complete
Quantum Information & Computation
Quantum Information & Computation
Notes on super-operator norms induced by schatten norms
Quantum Information & Computation
An upper bound on the threshold quantum decoherence rate
Quantum Information & Computation
Commutative version of the local Hamiltonian problem and common eigenspace problem
Quantum Information & Computation
Quantum Information & Computation
Constructions for quantum computing with symmetrized gates
Quantum Information & Computation
Classical and quantum tensor product expanders
Quantum Information & Computation
Exact universality from any entangling gate without inverses
Quantum Information & Computation
Quantum Information & Computation
The complexity of quantum spin systems on a two-dimensional square lattice
Quantum Information & Computation
Measuring 4-local qubit observables could probabilistically solve PSPACE
Quantum Information & Computation
Distinguishing quantum operations having few Kraus operators
Quantum Information & Computation
Quantum commitments from complexity assumptions
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
SIAM Journal on Computing
Short Seed Extractors against Quantum Storage
SIAM Journal on Computing
Entangled Games Are Hard to Approximate
SIAM Journal on Computing
On beating the hybrid argument
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Quantum complexity of testing group commutativity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Quantum noisy rational function reconstruction
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
From quantum physics to programming languages: a process algebraic approach
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
Quantum interactive proofs with competing provers
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory (TOCT)
The complexity of the local hamiltonian problem
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
The Deutsch---Jozsa problem: de-quantisation and entanglement
Natural Computing: an international journal
Consistency of local density matrices is QMA-Complete
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Universal sets of quantum information processing primitives and their optimal use
General Theory of Information Transfer and Combinatorics
Theoretical Computer Science
A symbolic approach to quantum computation simulation
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Complete problem for perfect zero-knowledge quantum proof
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Constructing arbitrary steane code single logical qubit fault-tolerant gates
Quantum Information & Computation
Complexity of commuting Hamiltonians on a square lattice of qubits
Quantum Information & Computation
On QMA protocols with two short quantum proofs
Quantum Information & Computation
Black-box hamiltonian simulation and unitary implementation
Quantum Information & Computation
Computer Science Review
A surprisingly simple way of reversing trace distance via entanglement
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Hardness of approximation for quantum problems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Epsilon-net method for optimizations over separable states
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Quantum walks: a comprehensive review
Quantum Information Processing
Nearly private information retrieval
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Stronger methods of making quantum interactive proofs perfectly complete
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Quantum phase estimation with arbitrary constant-precision phase shift operators
Quantum Information & Computation
QMA variants with polynomially many provers
Quantum Information & Computation
Product-state approximations to quantum ground states
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Inverting well conditioned matrices in quantum logspace
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Guest column: the quantum PCP conjecture
ACM SIGACT News
A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth
Quantum Information & Computation
Usability problems and lines of solutions: an expert evaluation of Chilean online services
Proceedings of the 2013 Chilean Conference on Human - Computer Interaction
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates
Quantum Information & Computation
The local Hamiltonian problem on a line with eight states is QMA-complete
Quantum Information & Computation
Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements
Proceedings of the 5th conference on Innovations in theoretical computer science
Selecting efficient phase estimation with constant-precision phase shift operators
Quantum Information Processing
Quantum Information & Computation
| Hi-index | 0.01 |