N-qubit universal quantum logic with a photonic qudit and O(N) linear optics elements

• URL: http://arxiv.org/abs/2410.06334v1
• Date: Tue, 8 Oct 2024 20:14:35 GMT
• Title: N-qubit universal quantum logic with a photonic qudit and O(N) linear optics elements
• Authors: Aymeric Delteil,
• Abstract summary: High-dimensional quantum units of information, or qudits, can carry more than one quantum bit of information in a single degree of freedom. We show that N-qubit states encoded in a single time-bin qudit can be arbitrarily and deterministically generated, manipulated and measured.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: High-dimensional quantum units of information, or qudits, can carry more than one quantum bit of information in a single degree of freedom, and can therefore be used to boost the performance of quantum communication and quantum computation protocols. A photon in a superposition of $2^N$ time bins - a time-bin qudit - contains as much information as N qubits. Here, we show that N-qubit states encoded in a single time-bin qudit can be arbitrarily and deterministically generated, manipulated and measured using a number of linear optics elements that scales linearly with N, as opposed with prior proposals of single-qudit implementation of N-qubit logic, which typically requires $O(2^N)$ elements. The simple and cost-effective implementation we propose can be used as a small-scale quantum processor. We then demonstrate a path towards scalability by interfacing distinct qudit processors to a matter qubit (atom or quantum dot spin) in an optical resonator. Such a cavity QED system allows for more advanced functionalities, such as single-qubit nondemolition measurement and two-qubit gates between distinct qudits. It could also enable quantum interfaces with other matter quantum nodes in the context of quantum networks and distributed quantum computing.

Related papers

• A quantum-network register assembled with optical tweezers in an optical cavity [0.0]
  Quantum computation and quantum communication are expected to provide users with capabilities inaccessible by classical physics. One solution is to develop a quantum network consisting of small-scale quantum registers containing computation qubits. We report on a register that uses both optical tweezers and optical lattices to deterministically assemble a two-dimensional array of atoms in an optical cavity.
  arXiv  Detail & Related papers  (2024-07-12T09:20:57Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• Realization of quantum algorithms with qudits [0.7892577704654171]
  We review several ideas indicating how multilevel quantum systems, also known as qudits, can be used for efficient realization of quantum algorithms. We focus on techniques of leveraging qudits for simplifying decomposition of multiqubit gates, and for compressing quantum information by encoding multiple qubits in a single qudit. These theoretical schemes can be implemented with quantum computing platforms of various nature, such as trapped ions, neutral atoms, superconducting junctions, and quantum light.
  arXiv  Detail & Related papers  (2023-11-20T18:34:19Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Quantum advantage using high-dimensional twisted photons as quantum finite automata [0.0]
  We show an experimental implementation of multi-qubit QFAs encoded on a single photon. Using two to eight OAM quantum states to implement up to four parallel qubits, we show that a high-dimensional QFA is able to detect the prime numbers 5 and 11. Our work benefits from the ease of encoding, manipulating, and deciphering multi-qubit states encoded in the OAM degree of freedom of single photons.
  arXiv  Detail & Related papers  (2022-02-10T09:16:04Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• 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)
• A divide-and-conquer algorithm for quantum state preparation [2.2596039727344457]
  We show that it is possible to load an N-dimensional vector with a quantum circuit with polylogarithmic depth and entangled information in ancillary qubits. Results show that we can efficiently load data in quantum devices using a divide-and-conquer strategy to exchange computational time for space.
  arXiv  Detail & Related papers  (2020-08-04T13:26:07Z)
• Computational advantage from quantum superposition of multiple temporal orders of photonic gates [0.0]
  A control quantum system can coherently determine the order in which a target quantum system undergoes $N$ gate operations. We experimentally demonstrate the quantum $N$-switch with $N=4$ gates acting on a photonic-polarization qubit. This is the first observation of a quantum superposition of more than $N=2$ temporal orders.
  arXiv  Detail & Related papers  (2020-02-18T19:00:01Z)

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.