Quantum State Discrimination Circuits Inspired by Deutschian Closed Timelike Curves

• URL: http://arxiv.org/abs/2109.11549v2
• Date: Fri, 20 May 2022 02:18:17 GMT
• Title: Quantum State Discrimination Circuits Inspired by Deutschian Closed Timelike Curves
• Authors: Christopher Vairogs, Vishal Katariya, and Mark M. Wilde
• Abstract summary: A party with access to a Deutschian closed timelike curve (D-CTC) can perfectly distinguish multiple non-orthogonal quantum states. We propose a practical method for discriminating multiple non-orthogonal states, by using a previously known quantum circuit designed to simulate D-CTCs.
• Score: 4.779196219827506
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It is known that a party with access to a Deutschian closed timelike curve (D-CTC) can perfectly distinguish multiple non-orthogonal quantum states. In this paper, we propose a practical method for discriminating multiple non-orthogonal states, by using a previously known quantum circuit designed to simulate D-CTCs. This method relies on multiple copies of an input state, multiple iterations of the circuit, and a fixed set of unitary operations. We first characterize the performance of this circuit and study its asymptotic behavior. We also show how it can be equivalently recast as a local, adaptive circuit that may be implemented simply in an experiment. Finally, we prove that our state discrimination strategy achieves the multiple Chernoff bound when discriminating an arbitrary set of pure qubit states.

Related papers

• Learning State Preparation Circuits for Quantum Phases of Matter [0.294944680995069]
  We introduce a flexible and efficient framework for obtaining a state preparation circuit for a large class of many-body ground states. We use a variant of the quantum Markov chain condition that remains robust against constant-depth circuits.
  arXiv  Detail & Related papers  (2024-10-31T01:10:46Z)
• Entangling Schrödinger's cat states by seeding a Bell state or swapping the cats [0.17708236183599538]
  We show that a DV-CV hybrid approach enables us to entangle a pair of Schr"odinger's cat states by two straightforward methods. Our work offers a simple yet powerful application of DV-CV hybridization while also highlighting the scalability of this planar KPO system.
  arXiv  Detail & Related papers  (2024-06-26T01:04:24Z)
• Quantum Many-Body Scars in Dual-Unitary Circuits [0.0]
  We present a method to construct dual-unitary circuits for which some simple initial states fail to thermalize. This is achieved by embedding quantum many-body scars in a circuit of arbitrary size and local Hilbert space dimension.
  arXiv  Detail & Related papers  (2023-07-13T13:49:53Z)
• Classical benchmarking of zero noise extrapolation beyond the exactly-verifiable regime [1.2569180784533303]
  We compare the experimental results to matrix product operator simulations of the Heisenberg evolution. We observe a discrepancy of up to $20%$ among the different classical approaches.
  arXiv  Detail & Related papers  (2023-06-30T17:57:26Z)
• 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)
• Variational determination of arbitrarily many eigenpairs in one quantum circuit [8.118991737495524]
  A variational quantum eigensolver (VQE) was first introduced for computing ground states. We propose a new algorithm to determine many low energy eigenstates simultaneously. Our algorithm reduces significantly the complexity of circuits and the readout errors.
  arXiv  Detail & Related papers  (2022-06-22T13:01:37Z)
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits [68.8204255655161]
  We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems can be employed to assess the simulatability.
  arXiv  Detail & Related papers  (2022-03-21T17:57:02Z)
• Bose-Einstein condensate soliton qubit states for metrological applications [58.720142291102135]
  We propose novel quantum metrology applications with two soliton qubit states. Phase space analysis, in terms of population imbalance - phase difference variables, is also performed to demonstrate macroscopic quantum self-trapping regimes.
  arXiv  Detail & Related papers  (2020-11-26T09:05:06Z)
• Hardware-Encoding Grid States in a Non-Reciprocal Superconducting Circuit [62.997667081978825]
  We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code. We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
  arXiv  Detail & Related papers  (2020-02-18T16:45:09Z)
• Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
  We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
  arXiv  Detail & Related papers  (2020-01-03T11:48:11Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.