Towards the coherent control of robust spin qubits in quantum algorithms

• URL: http://arxiv.org/abs/2303.12655v2
• Date: Tue, 30 Jul 2024 09:21:44 GMT
• Title: Towards the coherent control of robust spin qubits in quantum algorithms
• Authors: Luis Escalera-Moreno,
• Abstract summary: We run one-spin-qubit gate-based algorithms subject to relaxation. We evaluate the impact of relaxation and potential experimental imperfections in the calculated fidelities. This work will stimulate the study of many-spin-qubit systems in quantum algorithms.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many efforts have succeeded over the last decade at lengthening the timescale in which spin qubits loss quantum information under free evolution. With these design principles at a mature stage, it is now timely to widen the scope and take the whole picture: concerning applications that require user-driven coherent evolutions, qubits should be assessed operating within the desired algorithm. This means to test qubits under external control while relaxation and imperfections are active, and to maximize the algorithm fidelity as the actual figure of merit. Herein, we pose and analytically solve a master equation devised to run one-spin-qubit gate-based algorithms subject to relaxation. It is handled via a home-made code, QBithm, which inputs gate sequences and relaxation rates thus connecting with the longstanding work devoted to their $\textit{ab initio}$ computation. We evaluate the impact of relaxation and potential experimental imperfections in the calculated fidelities, and implement well-known pulse sequences quantitatively agreeing with experimental data. Hopefully, this work will stimulate the study of many-spin-qubit systems in quantum algorithms, and will serve as a help to design robust spin qubits against decoherence and to perform better-characterized experiments.

Related papers

• A Novel Quantum Algorithm for Efficient Attractor Search in Gene Regulatory Networks [0.0978224644130106]
  We demonstrate a novel quantum search algorithm inspired by Grover's algorithm to be implemented on quantum computing platforms. The algorithm performs an iterative suppression of states belonging to basins of previously discovered attractors from a uniform superposition. Tests of its resistance to noise have also shown promising performance on devices from the current Noise Intermediate Scale Quantum Computing (NISQ) era.
  arXiv  Detail & Related papers  (2024-08-16T15:48:45Z)
• Predicting Probabilities of Error to Combine Quantization and Early Exiting: QuEE [68.6018458996143]
  We propose a more general dynamic network that can combine both quantization and early exit dynamic network: QuEE. Our algorithm can be seen as a form of soft early exiting or input-dependent compression. The crucial factor of our approach is accurate prediction of the potential accuracy improvement achievable through further computation.
  arXiv  Detail & Related papers  (2024-06-20T15:25:13Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Robust Control of Single-Qubit Gates at the Quantum Speed Limit [0.0]
  We investigate the underlying robust time-optimal control problem so as to make the best balance. Based on the Taylor expansion of the system's unitary propagator, we formulate the design problem as the optimal control of an augmented finite-dimensional system. Numerical simulations for single-qubit systems show that the obtained time-optimal control pulses can effectively suppress gate errors.
  arXiv  Detail & Related papers  (2023-09-11T10:10:58Z)
• Making Trotterization adaptive and energy-self-correcting for NISQ devices and beyond [0.0]
  Simulation of continuous time evolution requires time discretization on both classical and quantum computers. We introduce a quantum algorithm to solve this problem, providing a controlled solution of the quantum many-body dynamics of local observables. Our algorithm can be potentially useful on a more general level whenever time discretization is involved concerning, for instance, also numerical approaches based on time-evolving block decimation methods.
  arXiv  Detail & Related papers  (2022-09-26T12:54:32Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Optimality and Complexity in Measured Quantum-State Stochastic Processes [0.0]
  We show that optimal prediction requires using an infinite number of temporal features. We identify the mechanism underlying this complicatedness as generator nonunifilarity. This makes it possible to quantitatively explore the influence that measurement choice has on a quantum process' degrees of randomness.
  arXiv  Detail & Related papers  (2022-05-08T21:43:06Z)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• 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)
• Experimental implementation of universal holonomic quantum computation on solid-state spins with optimal control [12.170408456188934]
  We experimentally implement nonadiabatic holonomic quantum computation with solid spins in diamond at room-temperature. Compared with previous geometric methods, the fidelities of a universal set of holonomic single-qubit and two-qubit quantum logic gates are improved. This work makes an important step towards fault-tolerant scalable geometric quantum computation in realistic systems.
  arXiv  Detail & Related papers  (2021-02-18T09:02:02Z)

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.