Realizing quantum gates with optically-addressable $^{171}$Yb$^{+}$ ion qudits

• URL: http://arxiv.org/abs/2210.09121v4
• Date: Tue, 9 May 2023 17:28:38 GMT
• Title: Realizing quantum gates with optically-addressable $^{171}$Yb$^{+}$ ion qudits
• Authors: M.A. Aksenov, I.V. Zalivako, I.A. Semerikov, A.S. Borisenko, N.V. Semenin, P.L. Sidorov, A.K. Fedorov, K.Yu. Khabarova, N.N. Kolachevsky
• Abstract summary: We present a proof-of-principle realization of a quantum processor register that uses optically-addressed $171$Yb$+$ ion qudits in a linear trap. The rich level structure of $171$Yb$+$ ions allows using the Zeeman sublevels of the quadrupole clock transition at 435.5 nm for efficient and robust qudit encoding.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The use of multilevel information carriers, also known as qudits, is a promising path for exploring scalability of quantum computing devices. Here we present a proof-of-principle realization of a quantum processor register that uses optically-addressed $^{171}$Yb$^{+}$ ion qudits in a linear trap. The rich level structure of $^{171}$Yb$^{+}$ ions allows using the Zeeman sublevels of the quadrupole clock transition at 435.5 nm for efficient and robust qudit encoding. We demonstrate the realization of the universal set of gates consisting of single-qudit rotations and a two-qudit Molmer-Sorensen operation with a two-ququart system, which is formally equivalent to a universal gate-based four-qubit processor. Our results paves a way towards further studies of more efficient implementations of quantum algorithms with trapped-ion-based processors and, specifically, exploring properties of $^{171}$Yb$^{+}$ ion qudits.

Related papers

• Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
  We show that a quantum processor can correctly solve the basic classification task considered. With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
  arXiv  Detail & Related papers  (2024-06-17T18:20:51Z)
• Towards multiqudit quantum processor based on a $^{171}$Yb$^{+}$ ion string: Realizing basic quantum algorithms [29.67699443799741]
  We demonstrate a quantum processor based on a 3D linear Paul trap that uses $171$Yb$+$ ions with 8 individually controllable four-level qudits (ququarts) The design of the developed ion trap provides high secular, low heating rate, which, together with individual addressing and readout optical systems, allows executing quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-05T15:48:43Z)
• 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)
• Exploring Ququart Computation on a Transmon using Optimal Control [3.400020514088234]
  We demonstrate a superconducting ququart processor and implement high-fidelity ququart gates. Our results validate ququarts as a viable tool for quantum information processing.
  arXiv  Detail & Related papers  (2023-04-21T17:58:48Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Efficient parallelization of quantum basis state shift [0.0]
  We optimize the state shift algorithm by incorporating the shift in different directions in parallel. This provides a significant reduction in the depth of the quantum circuit in comparison to the currently known methods. We focus on the one-dimensional and periodic shift, but note that the method can be extended to more complex cases.
  arXiv  Detail & Related papers  (2023-04-04T11:01:08Z)
• Generalized Toffoli gate decomposition using ququints: Towards realizing Grover's algorithm with qudits [1.4732811715354455]
  We present an efficient decomposition of the generalized Toffoli gate on the five-level quantum systems, so-called ququints. Our results are applicable for quantum processors based on various physical platforms.
  arXiv  Detail & Related papers  (2022-12-23T18:05:44Z)
• Halving the cost of quantum multiplexed rotations [0.0]
  We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls. Our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations.
  arXiv  Detail & Related papers  (2021-10-26T06:49: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 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.