Efficient State Preparation for Metrology and Quantum Error Correction with Global Control

• URL: http://arxiv.org/abs/2312.05060v1
• Date: Fri, 8 Dec 2023 14:28:34 GMT
• Title: Efficient State Preparation for Metrology and Quantum Error Correction with Global Control
• Authors: Liam J. Bond, Matthew J. Davis, Ji\v{r}\'i Min\'a\v{r}, Rene Gerritsma, Gavin K. Brennen and Arghavan Safavi-Naini
• Abstract summary: We introduce a simple, experimentally realizable protocol that can prepare any specific superposition of permutationally invariant qubit states, also known as Dicke states. We demonstrate the utility of our protocol by numerically preparing several states with theoretical infidelities $1-mathcalF10-4$. We estimate that the protocol achieves fidelities $gtrsim 95%$ in the presence of typical experimental noise levels.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a simple, experimentally realizable protocol that can prepare any specific superposition of permutationally invariant qubit states, also known as Dicke states. The protocol is comprised entirely of global rotations and globally applied non-linear phase gates -- it does not require local addressability or ancilla qubits -- and hence can be readily implemented in a variety of experimental platforms, including trapped-ion quantum simulators and cavity QED systems. We demonstrate the utility of our protocol by numerically preparing several states with theoretical infidelities $1-\mathcal{F}<10^{-4}$: (i) metrologically useful $N$-qubit Dicke states in $\mathcal{O}(1)$ gate steps, (ii) the $N = 9$ qubit codewords of the Ruskai code with $P = 4$ gate steps, and (iii) the $N = 13$ qubit Gross codewords in $P = 7$ gate steps. Focusing on trapped-ion platforms, we estimate that the protocol achieves fidelities $\gtrsim 95\%$ in the presence of typical experimental noise levels, thus providing a pathway to the preparation of a variety of useful highly-entangled quantum states.

Related papers

• Gain on ground state of quantum system for truly $\mathcal{PT}$ symmetry [13.788223630896052]
  For a truly $mathcalPT$-symmetric quantum system, the conventional non-Hermitian Hamiltonian is $H = H_rm drive -igamma|1ranglelangle1| + igamma|0ranglelangle0|$.<n>We propose a method to achieve effective gain on the ground state $|0rangle$ ($+igamma|0ranglelangle0|$) after averaging all trajectories.
  arXiv  Detail & Related papers  (2025-07-30T14:47:50Z)
• High-Dimensional Quantum Key Distribution with Qubit-like States [0.0]
  We introduce a high-dimensional QKD protocol using qubit-like states, referred to as Fourier-qubits (or $textitF$-qubits) In our scheme, each $textitF$-qubit is a superposition of only two computational basis states with a relative phase that can take $d$ distinct values, where $d$ is the dimension of the computational basis. This non-mutually unbiased approach allows us to bound the information leaked to an eavesdropper, maintaining security in high-dimensional quantum systems despite the states' seemingly two-dimensional nature
  arXiv  Detail & Related papers  (2025-04-04T19:34:28Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements. We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate. In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• A Universal Circuit Set Using the $S_3$ Quantum Double [0.5231056284485742]
  We present a quantum double model $mathcalD(S_3)$ -- a specific non-Abelian topological code. We encode each physical degree of freedom of $mathcalD(S_3)$ into a novel, quantum, error-correcting code. Our proposal offers a promising path to realize universal topological quantum computation in the NISQ era.
  arXiv  Detail & Related papers  (2024-11-14T18:58:41Z)
• Hybrid Oscillator-Qubit Quantum Processors: Simulating Fermions, Bosons, and Gauge Fields [31.51988323782987]
  We develop a hybrid oscillator-qubit processor framework for quantum simulation of strongly correlated fermions and bosons. This framework gives exact decompositions of particle interactions as well as approximate methods based on the Baker-Campbell Hausdorff formulas. While our work focusses on an implementation in superconducting hardware, our framework can also be used in trapped ion, and neutral atom hardware.
  arXiv  Detail & Related papers  (2024-09-05T17:58:20Z)
• Scalable High-Dimensional Multipartite Entanglement with Trapped Ions [0.0]
  We generalize the celebrated one-axis twisting (OAT) Hamiltonian for $N$ qubits to qudits. We find that starting from a product state of an arbitrary number of atoms $N$, dynamics under BOAT leads to the formation of GHZ states for qutrits and ququarts. Our results open a path for the scalable generation and certification of high-dimensional multipartite entanglement on current atom-based quantum hardware.
  arXiv  Detail & Related papers  (2024-07-29T06:54:50Z)
• Optimized Quantum Simulation Algorithms for Scalar Quantum Field Theories [0.3394351835510634]
  We provide practical simulation methods for scalar field theories on a quantum computer that yield improveds. We implement our approach using a series of different fault-tolerant simulation algorithms for Hamiltonians. We find in both cases that the bounds suggest physically meaningful simulations can be performed using on the order of $4times 106$ physical qubits and $1012$ $T$-gates.
  arXiv  Detail & Related papers  (2024-07-18T18:00:01Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• $\mathcal{PT}$-symmetric mapping of three states and its implementation on a cloud quantum processor [0.9599644507730107]
  We develop a new $mathcalPT$-symmetric approach for mapping $N = 3$ pure qubit states.<n>Our algorithm has the same error rate for the attack on the three-state QKD protocol as the conventional minimum error, maximum confidence, and maximum mutual information strategies.<n>Our work opens new pathways for applying $mathcalPT$ symmetry in quantum communications, computing, and cryptography.
  arXiv  Detail & Related papers  (2023-12-27T18:51:33Z)
• Non-Local Multi-Qubit Quantum Gates via a Driven Cavity [0.0]
  We present two protocols for implementing deterministic non-local multi-qubit quantum gates on qubits coupled to a common cavity mode. The protocols rely only on a classical drive of the cavity modes, while no external drive of the qubits is required. We provide estimates of gate fidelities and durations for atomic and molecular qubits coupled to optical or microwave cavities, and suggest applications for quantum error correction.
  arXiv  Detail & Related papers  (2023-03-23T09:30:42Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling [30.53587208999909]
  We give a quantum algorithm for computing an $epsilon$-approximate Nash equilibrium of a zero-sum game in a $m times n$ payoff matrix with bounded entries. Given a standard quantum oracle for accessing the payoff matrix our algorithm runs in time $widetildeO(sqrtm + ncdot epsilon-2.5 + epsilon-3)$ and outputs a classical representation of the $epsilon$-approximate Nash equilibrium.
  arXiv  Detail & Related papers  (2023-01-10T02:56:49Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• SWAP Test for an Arbitrary Number of Quantum States [4.989480853499916]
  We develop an algorithm to generalize the quantum SWAP test for an arbitrary number $m$ of quantum states. We construct a quantum circuit able to simultaneously measure overlaps of $m$ arbitrary pure states.
  arXiv  Detail & Related papers  (2021-10-25T20:53:44Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum Optimal Control of Nuclear Spin Qudecimals in $^{87}\ ext{Sr}$ [0.0]
  We study the ability to implement unitary maps on states of the $I=9/2$ nuclear spin in textsuperscript87Sr. We numerically study the quantum speed-limit, optimal parameters, and the fidelity of arbitrary state preparation and full SU maps.
  arXiv  Detail & Related papers  (2021-06-25T15:43:26Z)
• Quantum Instruction Set Design for Performance [30.049549820997996]
  A quantum instruction set is where quantum hardware and software meet. We develop new characterization and compilation techniques for non-Clifford gates to accurately evaluate different quantum instruction set designs.
  arXiv  Detail & Related papers  (2021-05-13T04:39:33Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)
• Verification of phased Dicke states [2.4173125243170377]
  Dicke states are examples of quantum states with genuine multipartite entanglement. Phased Dicke states are a generalization of Dicke states and include antisymmetric basis states. We propose practical and efficient protocols for verifying phased Dicke states.
  arXiv  Detail & Related papers  (2020-04-15T04:09:56Z)
• Minimum optical depth multiport interferometers for approximating arbitrary unitary operations and pure states [37.69303106863453]
  We address the problem of, using multiport interferometers, approximating with a given infidelity any pure state preparation and any unitary operation.<n>By means of numerical calculations, we show that pure states, in any dimension $d$, can be prepared with infidelity.
  arXiv  Detail & Related papers  (2020-02-04T15:40:49Z)
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits [0.755972004983746]
  Variational quantum algorithms (VQAs) optimize the parameters $vectheta$ of a parametrized quantum circuit. We prove two results, assuming $V(vectheta)$ is an alternating layered ansatz composed of blocks forming local 2-designs. We illustrate these ideas with large-scale simulations, up to 100 qubits, of a quantum autoencoder implementation.
  arXiv  Detail & Related papers  (2020-01-02T18:18:25Z)

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.