Fault-tolerant quantum computation with constant error
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
SIAM Journal on Computing
On the Power of Quantum Computation
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Fault-tolerant quantum computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Self-testing of universal and fault-tolerant sets of quantum gates
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Interaction in quantum communication and the complexity of set disjointness
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A new protocol and lower bounds for quantum coin flipping
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Dense quantum coding and quantum finite automata
Journal of the ACM (JACM)
Two-way finite automata with quantum and classical states
Theoretical Computer Science - Natural computing
Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On Quantum and Approximate Privacy
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
Quantum time-space tradeoffs for sorting
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Optimal Lower Bounds for Quantum Automata and Random Access Codes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On Quantum and Classical Space-Bounded Processes with Algebraic Transition Amplitudes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum multi-prover interactive proof systems with limited prior entanglement
Journal of Computer and System Sciences
A new protocol and lower bounds for quantum coin flipping
Journal of Computer and System Sciences - STOC 2001
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 branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
Zero-knowledge against quantum attacks
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Exponential separation of quantum and classical online space complexity
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Structuring quantum effects: superoperators as arrows
Mathematical Structures in Computer Science
Quantum Programming With Mixed States
Electronic Notes in Theoretical Computer Science (ENTCS)
Lower bounds for predecessor searching in the cell probe model
Journal of Computer and System Sciences
Susceptible Two-Party Quantum Computations
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Improved constructions of mixed state quantum automata
Theoretical Computer Science
Mathematical logic and quantum finite state automata
Theoretical Computer Science
The Arrow Calculus as a Quantum Programming Language
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Quantum walks with multiple or moving marked locations
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
General properties of quantum zero-knowledge proofs
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Computation in Sofic Quantum Dynamical Systems
Natural Computing: an international journal
Limitations of quantum coset states for graph isomorphism
Journal of the ACM (JACM)
Experimentally feasible measures of distance between quantum operations
Quantum Information Processing
On quantum estimation, quantum cloning and finite quantum de finetti theorems
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
Testing non-isometry is QMA-complete
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
Unbounded-error quantum computation with small space bounds
Information and Computation
Depolarizing behavior of quantum channels in higher dimensions
Quantum Information & Computation
Computational distinguishability of degradable and antidegradable channels
Quantum Information & Computation
On quantum one-way permutations
Quantum Information & Computation
Security of quantum key distribution with imperfect devices
Quantum Information & Computation
An upper bound on the threshold quantum decoherence rate
Quantum Information & Computation
Distinguishing quantum operations having few Kraus operators
Quantum Information & Computation
Computing stabilized norms for quantum operations via the theory of completely bounded maps
Quantum Information & Computation
Characterizations of one-way general quantum finite automata
Theoretical Computer Science
Quantum finite automata and logics
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Complexity of quantum uniform and nonuniform automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
The universal composable security of quantum key distribution
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Quantum interactive proofs with competing provers
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Quantum-inspired immune clonal algorithm
ICARIS'05 Proceedings of the 4th international conference on Artificial Immune Systems
Quantum computation with write-only memory
Natural Computing: an international journal
Quantum predicative programming
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems
Quantum Information & Computation
Some bounds on the minimum number of queries required for quantum channel perfect discrimination
Quantum Information & Computation
Epistemic Quantum Computational Structures in a Hilbert-space Environment
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Hamming, permutations and automata
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Computation in sofic quantum dynamical systems
UC'07 Proceedings of the 6th international conference on Unconventional Computation
Stronger methods of making quantum interactive proofs perfectly complete
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |