A Foundation of Programming a Multi-tape Quantum Turing Machine
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Quantum Entanglement and the Communication Complexity of the Inner Product Function
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Lower Bounds in the Quantum Cell Probe Model
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Separating Quantum and Classical Learning
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On Quantum Computation with Some Restricted Amplitudes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On Quantum and Approximate Privacy
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Analysis of Quantum Functions (Preliminary Version)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical 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
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
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
A probabilistic model of computing with words
Journal of Computer and System Sciences
The pattern matrix method for lower bounds on quantum communication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Determining the equivalence for one-way quantum finite automata
Theoretical Computer Science
Multi-party Quantum Communication Complexity with Routed Messages
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Lower Bounds for Generalized Quantum Finite Automata
Language and Automata Theory and Applications
Some algebraic properties of measure-once two-way quantum finite automata
Quantum Information Processing
Quantum Information Processing
A review of procedures to evolve quantum algorithms
Genetic Programming and Evolvable Machines
New bounds on classical and quantum one-way communication complexity
Theoretical Computer Science
Note: A note on quantum sequential machines
Theoretical Computer Science
On a measurement-free quantum lambda calculus with classical control
Mathematical Structures in Computer Science
A property of quantum relative entropy with an application to privacy in quantum communication
Journal of the ACM (JACM)
Hierarchy and equivalence of multi-letter quantum finite automata
Theoretical Computer Science
Efficient Universal Quantum Circuits
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Quantum implicit computational complexity
Theoretical Computer Science
Classically-controlled Quantum Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilities to accept languages by quantum finite automata
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Unbounded-error classical and quantum communication complexity
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Quantum computation with devices whose contents are never read
UC'10 Proceedings of the 9th international conference on Unconventional computation
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
SIAM Journal on Computing
Quantum one-way communication can be exponentially stronger than classical communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
Strong direct product theorems for quantum communication and query complexity
Proceedings of the forty-third annual ACM symposium on Theory of computing
On quantum-classical equivalence for composed communication problems
Quantum Information & Computation
Counting, fanout and the complexity of quantum ACC
Quantum Information & Computation
Efficient universal quantum circuits
Quantum Information & Computation
Distributed construction of quantum fingerprints
Quantum Information & Computation
Recasting mermin's multi-player game into the framework of pseudo-telepathy
Quantum Information & Computation
Communication complexities of symmetric XOR functions
Quantum Information & Computation
Quantum communication complexity of block-composed functions
Quantum Information & Computation
Classical cryptographic protocols in a quantum world
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Classical and quantum parallelism in the quantum fingerprinting method
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Promised and distributed quantum search
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The universal composable security of quantum key distribution
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Quantum-inspired immune clonal algorithm
ICARIS'05 Proceedings of the 4th international conference on Artificial Immune Systems
Quantum and classical communication-space tradeoffs from rectangle bounds
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Quantum computation with write-only memory
Natural Computing: an international journal
Journal of Computer and System Sciences
A logic for quantum circuits and protocols
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
The communication complexity of non-signaling distributions
Quantum Information & Computation
SIAM Journal on Computing
Parallel quantum algorithm for finding the consistency of saaty's matrices
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Automata theory based on complete residuated lattice-valued logic: Turing machines
Fuzzy Sets and Systems
Computation with multiple CTCs of fixed length and width
Natural Computing: an international journal
Natural Computing: an international journal
Theoretical Computer Science
Quantum entanglement and the communication complexity of the inner product function
Theoretical Computer Science
Proving the Power of Postselection
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.01 |
We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomial-size quantum circuit. This result also enables us to construct a universal quantum computer which can simulate, with a polynomial factor slowdown, a broader class of quantum machines than that considered by E. Bernstein and U. Vazirani (1993), thus answering an open question raised by them. We also develop a theory of quantum communication complexity, and use it as a tool to prove that the majority function does not have a linear-size quantum formula.