Approximating many-body quantum states with quantum circuits and measurements

• URL: http://arxiv.org/abs/2403.07604v2
• Date: Thu, 28 Mar 2024 18:32:23 GMT
• Title: Approximating many-body quantum states with quantum circuits and measurements
• Authors: Lorenzo Piroli, Georgios Styliaris, J. Ignacio Cirac,
• Abstract summary: We show that by lifting the requirement of exact preparation, one can substantially save resources. In particular, the so-called $W$ and, more generally, Dicke states require a circuit depth and number of ancillas per site that are independent of the system size.
• Score: 0.3277163122167433
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce protocols to prepare many-body quantum states with quantum circuits assisted by local operations and classical communication. We show that by lifting the requirement of exact preparation, one can substantially save resources. In particular, the so-called $W$ and, more generally, Dicke states require a circuit depth and number of ancillas per site that are independent of the system size. As a biproduct of our work, we introduce an efficient scheme to implement certain non-local, non-Clifford unitary operators. We also discuss how similar ideas my be applied in the preparation of eigenstates of well-known spin models, both free and interacting.

Related papers

• 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)
• Quantum control without quantum states [0.0]
  We show that combining ideas from the fields of quantum invariants and of optimal control can be used to design optimal quantum control solutions. The states are specified only implicitly in terms of operators to which they are eigenstates. The scaling in numerical effort of the resultant approach is not given by the typically exponentially growing effort required for the specification of a time-evolved quantum state.
  arXiv  Detail & Related papers  (2024-05-24T14:48:00Z)
• Estimating many properties of a quantum state via quantum reservoir processing [2.5432391525687748]
  We propose a general framework for constructing classical approximations of arbitrary quantum states with quantum reservoirs. A key advantage of our method is that only a single local measurement setting is required for estimating arbitrary properties. This estimation scheme is extendable to higher-dimensional systems and hybrid systems with non-identical local dimensions.
  arXiv  Detail & Related papers  (2023-05-11T15:21:21Z)
• Multipartite High-dimensional Quantum State Engineering via Discrete Time Quantum Walk [8.875659216970327]
  We give two schemes for the engineering task of arbitrary quantum state in $c$-partite $d$-dimensional system. A concrete example of preparing generalized Bell states is given to demonstrate the first scheme we proposed. We also show how these schemes can be used to reduce the cost of long-distance quantum communication.
  arXiv  Detail & Related papers  (2022-12-23T06:06:16Z)
• 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)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• Creating and concentrating quantum resource states in noisy environments using a quantum neural network [2.834895018689047]
  We provide a versatile unified state preparation scheme based on a driven quantum network composed of randomly-coupled fermionic nodes. We show that our method is robust and can be utilized to create almost perfect maximally entangled, NOON, W, cluster, and discorded states. In very noisy systems, where noise is comparable to the driving strength, we show how to concentrate entanglement by mixing more states in a larger network.
  arXiv  Detail & Related papers  (2021-01-15T07:18:06Z)
• Heterogeneous Multipartite Entanglement Purification for Size-Constrained Quantum Devices [68.8204255655161]
  Purifying entanglement resources after their imperfect generation is an indispensable step towards using them in quantum architectures. Here we depart from the typical purification paradigm for multipartite states explored in the last twenty years. We find that smaller sacrificial' states, like Bell pairs, can be more useful in the purification of multipartite states than additional copies of these same states.
  arXiv  Detail & Related papers  (2020-11-23T19:00:00Z)
• Classifying global state preparation via deep reinforcement learning [0.0]
  We demonstrate global quantum control by preparing a continuous set of states with deep reinforcement learning. As application, we generate arbitrary superposition states for the electron spin in complex multi-level nitrogen-vacancy centers. Our method could help improve control of near-term quantum computers, quantum sensing devices and quantum simulations.
  arXiv  Detail & Related papers  (2020-05-26T14:28:15Z)
• 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)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.