Measurement-based quantum computation utilizing the graph states of Bose-Einstein condensates and continuous variables

• URL: http://arxiv.org/abs/2412.20668v2
• Date: Sun, 26 Jan 2025 00:17:43 GMT
• Title: Measurement-based quantum computation utilizing the graph states of Bose-Einstein condensates and continuous variables
• Authors: Genji Fujii,
• Abstract summary: Measurement-based quantum computation (MBQC) is a protocol for quantum computation that represents a model distinct from the circuit-based approach. MBQC has been proposed not only for qubits but also for qudits, continuous-variable (CV) qubits, and Bose-Einstein condensates (BECs) qubits.
• Score: 0.0
• License:
• Abstract: Measurement-based quantum computation (MBQC) is a protocol for quantum computation that represents a model distinct from the circuit-based approach. MBQC has been proposed not only for qubits but also for qudits, continuous-variable (CV) qubits, and Bose-Einstein condensates (BECs) qubits. In qubit-based MBQC, arbitrary rotations on the Bloch sphere can be performed by measuring a graph state. This naturally raises the question of whether arbitrary rotations on the Bloch sphere can similarly be achieved through measurements in other types of quantum bits. We have demonstrated that this can indeed be realized for BECs qubits by considering composite graph states involving CV qubits and BECs qubits.

Related papers

• Measurement-Based Quantum Compiling via Gauge Invariance [1.1510009152620668]
  We introduce a new paradigm for quantum compiling directly converting any quantum circuit to a class of graph states, independently from its size. The graph state can be rebuilt from the circuit and the input by employing a set of graphical rules similar to the Feynman's ones. Compared to Measurement Calculus, the ancillary qubits are reduced by 50% on QFT and 75% on QAOA.
  arXiv  Detail & Related papers  (2024-11-19T13:09:49Z)
• Protocol for nonlinear state discrimination in rotating condensate [0.0]
  mean field dynamics enables quantum information processing operations that are impossible in linear one-particle quantum mechanics. A nice feature of the protocol is that only readout of individual quantized circulation states (not superpositions) is required.
  arXiv  Detail & Related papers  (2024-04-25T02:18:34Z)
• Visually quantifying single-qubit quantum memory [0.0]
  We show that all single-qubit quantum memory can be quantified without trusting input state generation. We use the concept of the two-qubit quantum steering ellipsoids to a single-qubit quantum channel and define the channel ellipsoids.
  arXiv  Detail & Related papers  (2023-12-12T02:17:57Z)
• Single Qubit State Estimation on NISQ Devices with Limited Resources and SIC-POVMs [0.0]
  We consider the problem of estimating the quantum state of a qubit in a quantum processing unit without conducting direct measurements of it. We implement and test the circuit using the quantum computer of the Technical Research Centre of Finland as well as an IBM quantum computer.
  arXiv  Detail & Related papers  (2023-08-15T09:27:52Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Graph test of controllability in qubit arrays: A systematic way to determine the minimum number of external controls [62.997667081978825]
  We show how to leverage an alternative approach, based on a graph representation of the Hamiltonian, to determine controllability of arrays of coupled qubits. We find that the number of controls can be reduced from five to one for complex qubit-qubit couplings.
  arXiv  Detail & Related papers  (2022-12-09T12:59:44Z)
• Quantum advantage in temporally flat measurement-based quantum computation [0.0]
  We study the efficiency of measurement-based quantum computation with a completely flat temporal ordering of measurements. We identify a family of Boolean functions for which deterministic evaluation using non-adaptive MBQC is possible.
  arXiv  Detail & Related papers  (2022-12-07T14:34:56Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Quantum thermodynamic methods to purify a qubit on a quantum processing unit [68.8204255655161]
  We report on a quantum thermodynamic method to purify a qubit on a quantum processing unit equipped with identical qubits. Our starting point is a three qubit design that emulates the well known two qubit swap engine. We implement it on a publicly available superconducting qubit based QPU, and observe a purification capability down to 200 mK.
  arXiv  Detail & Related papers  (2022-01-31T16:13:57Z)

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.