CORR
2004
Springer
13 years 4 months ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they commu...
CCR
2004
13 years 4 months ago
2004
A team of researchers from the Massachusetts Institute of Technology (MIT) and Northwestern University (NU) is developing a system for long-distance, high-fidelity qubit teleporta...
ALGORITHMICA
2002
13 years 4 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
AI
2002
Springer
13 years 4 months ago
2002
Springer
Abstract In this paper, we describe our Question Answering (QA) system called QUANTUM. The goal of QUANTUM is to find the answer to a natural language question in a large document ...
ISCA
2007
IEEE
13 years 4 months ago
2007
IEEE
In recent years, quantum computing (QC) research has moved from the realm of theoretical physics and mathematics into real implementations [9]. With many different potential hardw...
TCAD
2008
13 years 4 months ago
2008
Abstract--Quantum circuits are time-dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal sy...
SLOGICA
2008
13 years 4 months ago
2008
In this paper we show how recent concepts from Dynamic Logic, and in particular from Dynamic Epistemic logic, can be used to model and interpret quantum behavior. Our main thesis ...
MSCS
2006
13 years 4 months ago
2006
We present a dynamic logic for reasoning about information flow in quantum programs. In particular, we give a finitary syntax and a relational semantics for a Logic of Quantum Pro...