Identifying quantum resources in encoded computations

• URL: http://arxiv.org/abs/2407.18394v1
• Date: Thu, 25 Jul 2024 21:01:18 GMT
• Title: Identifying quantum resources in encoded computations
• Authors: Jack Davis, Nicolas Fabre, Ulysse Chabaud,
• Abstract summary: We introduce a general framework which allows us to correctly identify quantum resources in encoded computations. We illustrate our general construction with the Gottesman--Kitaev--Preskill encoding of qudits with odd dimension. The resulting Wigner function, which we call the Zak-Gross Wigner function, is shown to correctly identify quantum resources through its phase-space negativity.
• Score: 0.6144680854063939
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: What is the origin of quantum computational advantage? Providing answers to this far-reaching question amounts to identifying the key properties, or quantum resources, that distinguish quantum computers from their classical counterparts, with direct applications to the development of quantum devices. The advent of universal quantum computers, however, relies on error-correcting codes to protect fragile logical quantum information by robustly encoding it into symmetric states of a quantum physical system. Such encodings make the task of resource identification more difficult, as what constitutes a resource from the logical and physical points of view can differ significantly. Here we introduce a general framework which allows us to correctly identify quantum resources in encoded computations, based on phase-space techniques. For a given quantum code, our construction provides a Wigner function that accounts for how the symmetries of the code space are contained within the transformations of the physical space, resulting in an object capable of describing the logical content of any physical state, both within and outside the code space. We illustrate our general construction with the Gottesman--Kitaev--Preskill encoding of qudits with odd dimension. The resulting Wigner function, which we call the Zak-Gross Wigner function, is shown to correctly identify quantum resources through its phase-space negativity. For instance, it is positive for encoded stabilizer states and negative for the bosonic vacuum. We further prove several properties, including that its negativity provides a measure of magic for the logical content of a state, and that its marginals are modular measurement distributions associated to conjugate Zak patches.

Related papers

• Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams [3.393749500700096]
  Quantum computers have the potential to solve intractable problems. One key element to exploiting this potential is the capability to efficiently prepare quantum states for multi-valued, or qudit, systems. In this paper, we investigate quantum state preparation with a focus on mixed-dimensional systems.
  arXiv  Detail & Related papers  (2024-06-05T18:00:01Z)
• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• Simulating 2D lattice gauge theories on a qudit quantum computer [2.2246996966725305]
  We present a quantum computation of the properties of the basic building block of two-dimensional lattice quantum electrodynamics. This is made possible by the use of a trapped-ion qudit quantum processor. Qudits are ideally suited for describing gauge fields, which are naturally high-dimensional.
  arXiv  Detail & Related papers  (2023-10-18T17:06:35Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Unclonability and Quantum Cryptanalysis: From Foundations to Applications [0.0]
  Unclonability is a fundamental concept in quantum theory and one of the main non-classical properties of quantum information. We introduce new notions of unclonability in the quantum world, namely quantum physical unclonability. We discuss several applications of this new type of unclonability as a cryptographic resource for designing provably secure quantum protocols.
  arXiv  Detail & Related papers  (2022-10-31T17:57:09Z)
• 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)
• Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding [58.720142291102135]
  We define a resource measure for magic, the sought-after property in most fault-tolerant quantum computers. Our formulation is based on bosonic codes, well-studied tools in continuous-variable quantum computation.
  arXiv  Detail & Related papers  (2021-09-27T12:56:01Z)
• Entanglement transfer, accumulation and retrieval via quantum-walk-based qubit-qudit dynamics [50.591267188664666]
  Generation and control of quantum correlations in high-dimensional systems is a major challenge in the present landscape of quantum technologies. We propose a protocol that is able to attain entangled states of $d$-dimensional systems through a quantum-walk-based it transfer & accumulate mechanism. In particular, we illustrate a possible photonic implementation where the information is encoded in the orbital angular momentum and polarization degrees of freedom of single photons.
  arXiv  Detail & Related papers  (2020-10-14T14:33:34Z)
• Cost of quantum entanglement simplified [13.683637401785505]
  We introduce an entanglement measure that has a precise information-theoretic meaning as the exact cost required to prepare an entangled state. Our results bring key insights into the fundamental entanglement structure of arbitrary quantum states, and they can be used directly to assess and quantify the entanglement produced in quantum-physical experiments.
  arXiv  Detail & Related papers  (2020-07-28T14:36:23Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)

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.