Transferring quantum information between a quantum system with limited control and a quantum computer

• URL: http://arxiv.org/abs/2110.05683v1
• Date: Tue, 12 Oct 2021 02:03:28 GMT
• Title: Transferring quantum information between a quantum system with limited control and a quantum computer
• Authors: Ryosuke Sakai, Akihito Soeda, Mio Murao
• Abstract summary: We consider a hybrid quantum system consisting of a qubit system continuously evolving according to its fixed own Hamiltonian and a quantum computer. We present quantum algorithms to approximately transfer quantum information between the qubit system with limited control and the quantum computer under this setting.
• Score: 4.511923587827301
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider a hybrid quantum system consisting of a qubit system continuously evolving according to its fixed own Hamiltonian and a quantum computer. The qubit system couples to a quantum computer through a fixed interaction Hamiltonian, which can only be switched on and off. We present quantum algorithms to approximately transfer quantum information between the qubit system with limited control and the quantum computer under this setting. Our algorithms are programmed by the gate sequences in a closed formula for a given interface interaction Hamiltonian.

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)
• Time optimal quantum state transfer in a fully-connected quantum computer [1.431386688501923]
  We develop a new Quantum Brachistochrone method that can incorporate inequality constraints on the Hamiltonian. This method allows us to prove an exactly tight bound on the speed of QST on a subclass of Hamiltonians experimentally realizable by a fully-connected quantum computer.
  arXiv  Detail & Related papers  (2023-03-08T18:59:09Z)
• Digital quantum simulation of quantum gravitational entanglement with IBM quantum computers [0.0]
  We report the digital quantum simulation of a hamiltonian involved in the generation of quantum entanglement by gravitational means. We perform a boson-qubit mapping and a digital gate decomposition specific for IBM quantum devices.
  arXiv  Detail & Related papers  (2023-02-08T11:42:38Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• A prototype of quantum von Neumann architecture [0.0]
  We propose a model of universal quantum computer system, the quantum version of the von Neumann architecture. It uses ebits as elements of the quantum memory unit, and qubits as elements of the quantum control unit and processing unit. Our primary study demonstrates the manifold power of quantum information and paves the way for the creation of quantum computer systems.
  arXiv  Detail & Related papers  (2021-12-17T06:33:31Z)
• 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)
• 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)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Relaxation to Equilibrium in a Quantum Network [0.0]
  We study the relaxation to equilibrium for a fully connected quantum network with CNOT gates. We give a number of results for the equilibration in these systems, including analytic estimates.
  arXiv  Detail & Related papers  (2020-09-28T22:15:35Z)
• Contraction-free quantum state encoding by quantum tunneling in single molecules [0.0]
  We propose a new system and theory for quantum computing that employs single molecule confinement between electrodes. The striking features of this system are (i) an individual molecule that exhibits quantum tunneling can be regarded as a sequence of quantum gates, (ii) the quantum tunneling can be encoded onto an array of quantum bits, and (iii) quantum computing by quantum tunneling can be performed at room temperature.
  arXiv  Detail & Related papers  (2020-01-15T14:54:37Z)

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.