We define and construct efficient depth universal and almost size universal quantum circuits. Such circuits can be viewed as general purpose simulators for central classes of quantum circuits and can be used to capture the computational power of the circuit class being simulated. For depth we construct universal circuits whose depth is the same order as the circuits being simulated. For size, there is a log factor blow-up in the universal circuits constructed here. We prove that this construction is nearly optimal. Our results apply to a number of well-studied quantum circuit classes.Army Research Office (DAAD 19-02-1-0058, DAAD 19-02-0058); NSF (CCF-05-015269
AbstractWe discuss an algorithmic construction which, for any finite but universal set of computable...
Small depth quantum circuits have proved to be unexpectedly powerful in comparison to their classica...
International audienceIn quantum computing the decoherence time of the qubits determines the computa...
We define and construct efficient depth universal and almost size universal quantum circuits. Such c...
Abstract. We define and construct efficient depth-universal and almost-size-universal quantum circui...
Abstract. We define and construct efficient depth-universal and almost-size-universal quantum circui...
We show that the depth of quantum circuits in the realistic architecture where a classical controlle...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Quantum computation has attracted much attention, among other things, due to its potentialities to s...
Quantum computation promises to solve fundamental, yet otherwise intractable, problems across a rang...
Arbitrary exponentially large unitaries cannot be implemented efficiently by quantum circuits. Howev...
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can ef...
Arbitrary exponentially large unitaries cannot be implemented efficiently by quantum circuits. Howev...
Arbitrary exponentially large unitaries cannot be implemented efficiently by quantum circuits. Howev...
We show that the depth of quantum circuits in the realistic architecture where a classical controlle...
AbstractWe discuss an algorithmic construction which, for any finite but universal set of computable...
Small depth quantum circuits have proved to be unexpectedly powerful in comparison to their classica...
International audienceIn quantum computing the decoherence time of the qubits determines the computa...
We define and construct efficient depth universal and almost size universal quantum circuits. Such c...
Abstract. We define and construct efficient depth-universal and almost-size-universal quantum circui...
Abstract. We define and construct efficient depth-universal and almost-size-universal quantum circui...
We show that the depth of quantum circuits in the realistic architecture where a classical controlle...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Quantum computation has attracted much attention, among other things, due to its potentialities to s...
Quantum computation promises to solve fundamental, yet otherwise intractable, problems across a rang...
Arbitrary exponentially large unitaries cannot be implemented efficiently by quantum circuits. Howev...
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can ef...
Arbitrary exponentially large unitaries cannot be implemented efficiently by quantum circuits. Howev...
Arbitrary exponentially large unitaries cannot be implemented efficiently by quantum circuits. Howev...
We show that the depth of quantum circuits in the realistic architecture where a classical controlle...
AbstractWe discuss an algorithmic construction which, for any finite but universal set of computable...
Small depth quantum circuits have proved to be unexpectedly powerful in comparison to their classica...
International audienceIn quantum computing the decoherence time of the qubits determines the computa...