Exact quantum dynamics for two-level systems with time-dependent driving
- URL: http://arxiv.org/abs/2211.03342v5
- Date: Fri, 08 Nov 2024 16:33:38 GMT
- Title: Exact quantum dynamics for two-level systems with time-dependent driving
- Authors: Zhi-Cheng He, Yi-Xuan Wu, Zheng-Yuan Xue,
- Abstract summary: Time-dependent Schr"odinger equation can only be exactly solvable in very rare cases.
We present a method which could generate a near infinite number of analytical-assisted solutions of the Schr"odinger equation for a qubit.
- Score: 2.69899958854431
- License:
- Abstract: It is well-known that time-dependent Schr\"{o}dinger equation can only be exactly solvable in very rare cases, even for two-level quantum systems. Therefore, finding exact quantum dynamics under time-dependent Hamiltonian is not only of fundamental importance in quantum physics but also can facilitate active quantum manipulations for quantum information processing. Here, we present a method which could generate a near infinite number of analytical-assisted solutions of the Schr\"{o}dinger equation for a qubit with time-dependent driving. This analytical-assisted solution has free parameters with only boundary restrictions, and thus can find many applications in precise quantum manipulations. Due to the general form of the time-dependent Hamiltonian in our scheme, it can be readily implemented in various experimental setups of qubits. Therefore, our scheme provides new solutions for Schr\"{o}dinger equation, thus provides an alternative and analytical-based routine for precise control over qubits.
Related papers
- Time-Dependent Dunkl-Schrödinger Equation with an Angular-Dependent Potential [0.0]
The Schr"odinger equation is a fundamental equation in quantum mechanics.
Over the past decade, theoretical studies have focused on adapting the Dunkl derivative to quantum mechanical problems.
arXiv Detail & Related papers (2024-08-04T13:11:52Z) - Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
Storing quantum information requires battling quantum decoherence, which results in a loss of information over time.
To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another.
We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
arXiv Detail & Related papers (2024-07-08T12:46:08Z) - Rapidly Achieving Chemical Accuracy with Quantum Computing Enforced Language Model [22.163742052849432]
QiankunNet-VQE is a transformer based language models enforced with quantum computing to learn and generate quantum states.
It has been implemented using up to 12 qubits and attaining an accuracy level competitive with state-of-the-art classical methods.
arXiv Detail & Related papers (2024-05-15T07:50:57Z) - Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics [42.29248343585333]
We benchmark quantum hardware and error mitigation techniques on up to 133 qubits.
We show reliable control up to a two-qubit gate depth of 28, featuring a maximum of 1396 two-qubit gates.
Results are transferable to applications such as Hamiltonian simulation, variational algorithms, optimization, or quantum machine learning.
arXiv Detail & Related papers (2024-04-11T18:00:05Z) - Quantum kernels for classifying dynamical singularities in a multiqubit system [0.0]
We use quantum Kernels to classify dynamical singularities of the rate function for a multiqubit system.
Our results show that this quantum dynamical critical problem can be efficiently solved using physically inspiring quantum Kernels.
arXiv Detail & Related papers (2023-10-06T15:01:37Z) - Minimum-Time Quantum Control and the Quantum Brachistochrone Equation [3.0616044531734192]
We present the general solution to the full quantum brachistochrone equation.
We prove that the speed of evolution under constraints is reduced with respect to the unrestricted case.
We find that solving the quantum brachistochrone equation is closely connected to solving the dynamics of the Lagrange multipliers.
arXiv Detail & Related papers (2022-04-27T09:26:59Z) - Quantum Optimization of Maximum Independent Set using Rydberg Atom
Arrays [39.76254807200083]
We experimentally investigate quantum algorithms for solving the Maximum Independent Set problem.
We find the problem hardness is controlled by the solution degeneracy and number of local minima.
On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions.
arXiv Detail & Related papers (2022-02-18T19:00:01Z) - Variational Quantum Eigensolver for SU($N$) Fermions [0.0]
Variational quantum algorithms aim at harnessing the power of noisy intermediate-scale quantum computers.
We apply the variational quantum eigensolver to study the ground-state properties of $N$-component fermions.
Our approach lays out the basis for a current-based quantum simulator of many-body systems.
arXiv Detail & Related papers (2021-06-29T16:39:30Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - Probing quantum information propagation with out-of-time-ordered
correlators [41.12790913835594]
Small-scale quantum information processors hold the promise to efficiently emulate many-body quantum systems.
Here, we demonstrate the measurement of out-of-time-ordered correlators (OTOCs)
A central requirement for our experiments is the ability to coherently reverse time evolution.
arXiv Detail & Related papers (2021-02-23T15:29:08Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z)
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.