Towards multiqudit quantum processor based on a $^{171}$Yb$^{+}$ ion string: Realizing basic quantum algorithms

• URL: http://arxiv.org/abs/2402.03121v2
• Date: Thu, 31 Oct 2024 19:51:18 GMT
• Title: Towards multiqudit quantum processor based on a $^{171}$Yb$^{+}$ ion string: Realizing basic quantum algorithms
• Authors: Ilia V. Zalivako, Anastasiia S. Nikolaeva, Alexander S. Borisenko, Andrei E. Korolkov, Pavel L. Sidorov, Kristina P. Galstyan, Nikita V. Semenin, Vasilii N. Smirnov, Mikhail A. Aksenov, Konstantin M. Makushin, Evgeniy O. Kiktenko, Aleksey K. Fedorov, Ilya A. Semerikov, Ksenia Yu. Khabarova, Nikolay N. Kolachevsky,
• Abstract summary: 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.
• Score: 29.67699443799741
• License:
• Abstract: 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), which is computationally equivalent to a 16-qubit quantum processor. The design of the developed ion trap provides high secular frequencies, low heating rate, which, together with individual addressing and readout optical systems, allows executing quantum algorithms. In each of the 8 ions, we use four electronic levels coupled by E2 optical transition at 435 nm for qudit encoding. We present the results of single- and two-qubit operations benchmarking and realizing basic quantum algorithms, including Bernstein-Vazirani and Grover's search algorithms as well as H$_2$ and LiH molecular simulations. Our results pave the way to scalable qudit-based quantum processors using trapped ions.

Related papers

• Implementation of a scalable universal two-qubit quantum processor with electron and nuclear spins in a trapped ion [3.2872851729958867]
  We propose a scalable n-ion-2n-qubit quantum processor utilizing four internal levels of each ion. We experimentally implement a 1-ion-2-qubit universal processor using the electron spin and nuclear spin of a single 171Yb+ ion. Our work paves the way towards achieving 2n-times increase in the size of quantum computational Hilbert space with n ions.
  arXiv  Detail & Related papers  (2024-07-01T11:40:45Z)
• 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)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• 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)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Efficient Quantum Simulation of Electron-Phonon Systems by Variational Basis State Encoder [12.497706003633391]
  Digital quantum simulation of electron-phonon systems requires truncating infinite phonon levels into $N$ basis states. We propose a variational basis state encoding algorithm that reduces the scaling of the number of qubits and quantum gates.
  arXiv  Detail & Related papers  (2023-01-04T04:23:53Z)
• Realizing quantum gates with optically-addressable $^{171}$Yb$^{+}$ ion qudits [0.0]
  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.
  arXiv  Detail & Related papers  (2022-10-17T14:13:57Z)
• Improving Quantum Simulation Efficiency of Final State Radiation with Dynamic Quantum Circuits [1.3375143521862154]
  We make use of a new quantum hardware capability called dynamical quantum computing to improve the scaling of the QPS algorithm. We modify the quantum parton shower circuit to incorporate mid-circuit qubit measurements, resets, and quantum operations conditioned on classical information.
  arXiv  Detail & Related papers  (2022-03-18T15:31:19Z)
• 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)
• Quantum circuit to estimate pi using quantum amplitude estimation [0.0]
  The proposed quantum circuit to estimate pi is based on the Monte Carlo method, quantum amplitude estimation, and quantum squarer. By applying the quantum squarer using QFT, the circuit was implemented in $ 4n + 1 $ qubits at $ 22n $ sampling.
  arXiv  Detail & Related papers  (2020-08-04T05:04:57Z)
• 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.