Search results for "TheoryofComputation_GENERAL"
showing 10 items of 106 documents
On-chip entangled D-level photon states – scalable generation and coherent processing
2018
Exploiting a micro-cavity-based quantum frequency comb, we demonstrate the on-chip generation of high-dimensional entangled quantum states with a Hilbert-space dimensionality larger than 100, and introduce a coherent control approach relying on standard telecommunications components.
On-chip Generation, Coherent Control and Processing of Complex Entangled Photon States
2019
We demonstrate the on-chip generation of time-bin entangled two- and multi-photon qubit states, as well as high-dimensional frequency-entangled photon pairs. Combining time and frequency entanglement, we generate high-dimensional optical cluster states and implement proof-of-concept high-dimensional one-way quantum computing. This, by using standard, fiber-based telecommunication components.
Entanglement between two superconducting qubits via interaction with nonclassical radiation
2003
We propose a scheme to physically interface superconducting nano-circuits and quantum optics. We address the transfer of quantum information between systems having different physical natures and defined in Hilbert spaces of different dimensions. In particular, we investigate the transfer of the entanglement initially in a non-classical state of a continuous-variable system to a pair of superconducting charge qubits. This set-up is able to drive an initially separable state of the qubits into an almost pure, highly entangled state suitable for quantum information processing.
Entanglement production by quantum error correction in the presence of correlated environment
2003
We analyze the effect of a quantum error correcting code on the entanglement of encoded logical qubits in the presence of a dephasing interaction with a correlated environment. Such correlated reservoir introduces entanglement between physical qubits. We show that for short times the quantum error correction interprets such entanglement as errors and suppresses it. However for longer time, although quantum error correction is no longer able to correct errors, it enhances the rate of entanglement production due to the interaction with the environment.
Entanglement generation and protection by detuning modulation
2006
We introduce a protocol for steady-state entanglement generation and protection based on detuning modulation in the dissipative interaction between a two-qubit system and a bosonic mode. The protocol is a global-addressing scheme which only requires control over the system as a whole. We describe a postselection procedure to project the register state onto a subspace of maximally entangled states. We also outline how our proposal can be implemented in a circuit-quantum electrodynamics setup.
Demonstration of a fully tuneable entangling gate for continuous-variable one-way quantum computation
2015
We introduce a fully tuneable entangling gate for continuous-variable one-way quantum computation. We present a proof-of-principle demonstration by propagating two independent optical inputs through a three-mode linear cluster state and applying the gate in various regimes. The genuine quantum nature of the gate is confirmed by verifying the entanglement strength in the output state. Our protocol can be readily incorporated into efficient multi-mode interaction operations in the context of large-scale one-way quantum computation, as our tuning process is the generalisation of cluster state shaping.
Single and two-qubit dynamics in circuit QED architectures
2008
In this paper we overview our researches on the generation and the control of entangled states in the framework of circuit quantum electrodynamics. Applications in the context of quantum computing and quantum information theory are discussed.
Quantum Property Testing for Bounded-Degree Graphs
2011
We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion, we also prove an Omega(N^(1/4)) quantum query lower bound, thus ruling out the possibility of an exponential quantum speedup. Our quantum algorithms follow from a combination of classical property testing techniques due to Goldreich and Ron, derandomization, and the quantum algorithm for element distinctness. The quantum lower bound is obtained by the polynomial method, using novel algebraic techniques and combinatorial analysis to accommodate the graph s…
Ultrafast Long-Distance Quantum Communication with Static Linear Optics
2015
We propose a projection measurement onto encoded Bell states with a static network of linear optical elements. By increasing the size of the quantum error correction code, both Bell measurement efficiency and photon-loss tolerance can be made arbitrarily high at the same time. As a main application, we show that all-optical quantum communication over large distances with communication rates similar to those of classical communication is possible solely based on local state teleportations using optical sources of encoded Bell states, fixed arrays of beam splitters, and photon detectors. As another application, generalizing state teleportation to gate teleportation for quantum computation, we…
Indistinguishability as a quantum information resource by localized measurements
2019
Quantum networks are typically made of identical subsystems. Exploiting indistinguishability as a direct quantum resource would thus be highly desirable. We show this is achievable by spatially localized measurements, enabling teleportation and entanglement swapping protocols.