Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 77 tok/s
Gemini 2.5 Pro 56 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 21 tok/s Pro
GPT-4o 107 tok/s Pro
Kimi K2 196 tok/s Pro
GPT OSS 120B 436 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Optimizing quantum control pulses with complex constraints and few variables through Tensorflow (2110.05334v2)

Published 11 Oct 2021 in quant-ph and physics.comp-ph

Abstract: Applying optimal control algorithms on realistic quantum systems confronts two key challenges: to efficiently adopt physical constraints in the optimization and to minimize the variables for the convenience of experimental tune-ups. In order to resolve these issues, we propose a novel algorithm by incorporating multiple constraints into the gradient optimization over piece-wise pulse constant values, which are transformed to contained numbers of the finite Fourier basis for bandwidth control. Such complex constraints and variable transformation involved in the optimization introduce extreme difficulty in calculating gradients. We resolve this issue efficiently utilizing auto-differentiation on Tensorflow. We test our algorithm by finding smooth control pulses to implement single-qubit and two-qubit gates for superconducting transmon qubits with always-on interaction, which remains a challenge of quantum control in various qubit systems. Our algorithm provides a promising optimal quantum control approach that is friendly to complex and optional physical constraints.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.