Universal deterministic quantum operations in microwave quantum links

• URL: http://arxiv.org/abs/2110.02092v2
• Date: Fri, 3 Jun 2022 13:50:43 GMT
• Title: Universal deterministic quantum operations in microwave quantum links
• Authors: Guillermo F. Pe\~nas, Ricardo Puebla, Tom\'as Ramos, Peter Rabl, Juan Jos\'e Garc\'ia-Ripoll
• Abstract summary: We propose a realistic setup, inspired by already existing experiments, within which we develop a general formalism for the implementation of distributed quantum gates. We identify the most relevant imperfections in the quantum links as well as optimal points of operation with resulting infidelities of $1-F approx 10-2-10-3$.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a realistic setup, inspired by already existing experiments, within which we develop a general formalism for the implementation of distributed quantum gates. Mediated by a quantum link that establishes a bidirectional quantum channel between distant nodes, our proposal works both for inter- and intra node communication and handles scenarios ranging from the few to the many modes limit of the quantum link. We are able to design fast and reliable state transfer protocols in every regime of operation, which, together with a detailed description of the scattering process, allows us to engineer two sets of deterministic universal distributed quantum gates. Gates whose implementation in quantum networks does not need entanglement distribution nor measurements. By employing a realistic description of the physical setup we identify the most relevant imperfections in the quantum links as well as optimal points of operation with resulting infidelities of $1-F \approx 10^{-2}-10^{-3}$.

Related papers

• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Enhanced quantum state transfer: Circumventing quantum chaotic behavior [35.74056021340496]
  We show how to transfer few-particle quantum states in a two-dimensional quantum network. Our approach paves the way to short-distance quantum communication for connecting distributed quantum processors or registers.
  arXiv  Detail & Related papers  (2024-02-01T19:00:03Z)
• Nonlocal photonic quantum gates over 7.0 km [5.545769900845797]
  We demonstrate nonlocal photonic quantum gates between two nodes spatially separated by 7.0 km. Results are a proof-of-principle demonstration of quantum gates over metropolitan-scale distances.
  arXiv  Detail & Related papers  (2023-07-28T15:49:00Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Cavity-enhanced quantum network nodes [0.0]
  A future quantum network will consist of quantum processors that are connected by quantum channels. I will describe how optical resonators facilitate quantum network nodes.
  arXiv  Detail & Related papers  (2022-05-30T18:50:35Z)
• Discrete-time quantum walk approach to high-dimensional quantum state transfer and quantum routing [6.236377496735381]
  We propose a class of quantum-walk architecture networks that admit the efficient routing of high-dimensional quantum states. Perfect state transfer of an arbitrary unknown qudit state can be achieved between two arbitrary nodes via a one-dimensional lackadaisical discrete-time quantum walk.
  arXiv  Detail & Related papers  (2021-08-10T21:15:41Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Location qubits in a multi-quantum-dot system [0.0]
  We introduce novel location qubits, describe a method to construct a universal set of all-optical quantum gates, and simulate their performance in realistic structures. Our results show that location qubits can maintain coherence 5 orders of magnitude longer than single-qubit operation time, and single-qubit gate errors do not exceed 0.01%.
  arXiv  Detail & Related papers  (2021-07-13T10:00:16Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.