Holography as a resource for non-local quantum computation

• URL: http://arxiv.org/abs/2210.13500v1
• Date: Mon, 24 Oct 2022 18:00:25 GMT
• Title: Holography as a resource for non-local quantum computation
• Authors: Kfir Dolev and Sam Cree
• Abstract summary: We show that any finite-memory quantum system on a circular lattice yields a protocol for non-local quantum computation. Under plausible physical assumptions about quantum in the bulk, our results imply that non-local quantum computation can be performed for anyly complex unitary with a large amount of entanglement.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: If two parties share sufficient entanglement, they are able to implement any channel on a shared bipartite state via non-local quantum computation -- a protocol consisting of local operations and a single simultaneous round of quantum communication. Such a protocol can occur in the AdS/CFT correspondence, with the two parties represented by regions of the CFT, and the holographic state serving as a resource to provide the necessary entanglement. This boundary non-local computation is dual to the local implementation of a channel in the bulk AdS theory. Previous work on this phenomenon was obstructed by the divergent entanglement between adjacent CFT regions, and tried to circumvent this issue by assuming that certain regions are irrelevant. However, the absence of these regions introduces violent phenomena that prevent the CFT from implementing the protocol. Instead, we resolve the issue of divergent entanglement by using a finite-memory quantum simulation of the CFT. We show that any finite-memory quantum system on a circular lattice yields a protocol for non-local quantum computation. In the case of a quantum simulation of a holographic CFT, we carefully show that this protocol implements the channel performed by the local bulk dynamics. Under plausible physical assumptions about quantum computation in the bulk, our results imply that non-local quantum computation can be performed for any polynomially complex unitary with a polynomial amount of entanglement. Finally, we provide a concrete example of a holographic code whose bulk dynamics correspond to a Clifford gate, and use our results to show that this corresponds to a non-local quantum computation protocol for this gate.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Channel nonlocality under decoherence [0.0]
  We quantify nonlocality of bipartite quantum channels and identify its component resisting the effects of dephasing noise. We show that simulating certain processes with quantum channels undergoing decoherence has a communication advantage with respect to their classical simulation.
  arXiv  Detail & Related papers  (2024-08-19T18:00:05Z)
• Bidirectional classical communication cost of a bipartite quantum channel assisted by non-signalling correlations [6.1108095842541]
  This paper investigates the bidirectional classical communication cost of simulating a bipartite quantum channel assisted by non-signalling correlations. We derive semidefinite programming (SDP) formulations for the one-shot exact bidirectional classical communication cost via non-signalling bipartite superchannels. Our results elucidate the role of non-locality in quantum communication and pave the way for exploring quantum reverse Shannon theory in bipartite scenarios.
  arXiv  Detail & Related papers  (2024-08-05T14:30:50Z)
• Asymptotic implementation of multipartite quantum channels and other quantum instruments using local operations and classical communication [0.0]
  We prove that a quantum channel on a multipartite system may be approximated arbitrarily using local operations and classical communication (LOCC) We illustrate these results by a detailed analysis of a quantum instrument that is known not to be implementable by LOCC.
  arXiv  Detail & Related papers  (2023-10-09T02:44:28Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00: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)
• Entanglement-efficient bipartite-distributed quantum computing [1.2878452281783466]
  In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit can be extended through distributed quantum computing. To facilitate this type of DQC in experiments, we need an entanglement-efficient protocol. We extend the protocol in [Eisert et. al., PRA, 62:052317(2000)] to a packing protocol, which can pack multiple nonlocal controlled-unitary gates locally.
  arXiv  Detail & Related papers  (2022-12-24T08:45:44Z)
• 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)
• 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 communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Equivalence checking of quantum circuits by nonlocality [0.6091702876917279]
  We show that this realistic problem can be solved completely from the viewpoints of quantum nonlocality. Specifically, we design an elegant protocol that examines underlying quantum nonlocality. We show that the protocol also works approximately, where the distance between two quantum circuits can be calculated accurately.
  arXiv  Detail & Related papers  (2021-05-06T13:07:24Z)

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.