Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2403.05470 · AVS Quantum Science

Semicoherent symmetric quantum processes: Theory and applications

Yan Wang, Sarah Chehade, Eugene Dumitrescu

Published Sep 1, 2024• 3 citations
arXivHTMLPDF

Abstract

Discovering pragmatic and efficient approaches to construct ε-approximations of quantum operators such as real (imaginary) time-evolution propagators in terms of the basic quantum operations (gates) is challenging. Prior ε-approximations are invaluable, in that they enable the compilation of classical and quantum algorithm modeling of, e.g., dynamical and thermodynamic quantum properties. In parallel, symmetries are powerful tools concisely describing the fundamental laws of nature; the symmetric underpinnings of physical laws have consistently provided profound insights and substantially increased predictive power. In this work, we consider the interplay between the ε-approximate processes and the exact symmetries in a semicoherent context—where measurements occur at each logical clock cycle. We draw inspiration from Pascual Jordan's groundbreaking formulation of nonassociative, but commutative, symmetric algebraic form. Our symmetrized formalism is then applied in various domains such as quantum random walks, real-time evolutions, variational algorithm ansatzes, and efficient entanglement verification. Our work paves the way for a deeper understanding and greater appreciation of how symmetries can be used to control quantum dynamics in settings where coherence is a limited resource.

DOI
10.1116/5.0215919

Related papers

Irreversibility and symmetry principles in quantum information

Cristina Cîrstoiu

Symmetry principles have played a crucial role in the development of modern physics and underpin our most fundamental theories of nature. The present thesis is concerned with the analysis of symmetries in the context of quantum information theory. Whenever a quantum mechanical system interacts with its environment it is subjected to decoherence, a process that is typically irreversible and most generally treated abstractly using the concept of quantum operations. If there is an underlying symmetry principle, additional structures emerge. The central question we address is, What are the consequences of global or local gauge symmetry on the structure of many-body quantum processes?This leads us to a diagrammatic framework of decomposing quantum operations into terms that respond to the symmetry principle in particular ways and respect the causal structures involved. We present two core applications. First, we address the interplay between irreversibility and repeatable use of coherent resources under symmetry constraints. Second, we give an information-theoretic perspective on gauging globally symmetric dynamics to a local symmetry applicable even in the presence of irreversibility and thus it goes beyond the usual Lagrangian formulation. Finally, we analyse the departure from conservation laws under symmetric dynamics subject to decoherence.

•Dec 1, 2018•0 citations

Discrete-Time Quantum Walk - Dynamics and Applications

C. M. Chandrashekar

This dissertation presents investigations on dynamics of discrete-time quantum walk and some of its applications. Quantum walks has been exploited as an useful tool for quantum algorithms in quantum computing. Beyond quantum computational purposes, it has been used to explain and control the dynamics in various physical systems. In order to use the quantum walk to its fullest potential, it is important to know and optimize the properties purely due to quantum dynamics and in presence of noise. Various studies of its dynamics in the absence and presence of noise have been reported. We propose new approaches to optimize the dynamics, discuss symmetries and effect of noise on the quantum walk. Making use of its properties, we propose the use of quantum walk as an efficient new tool for various applications in physical systems and quantum information processing. In the first and second part of this dissertation, we discuss evolution process of the quantum walks, propose and demonstrate the optimization of discrete-time quantum walk using quantum coin operation from SU(2) group and discuss some of its properties. We investigate symmetry operations and environmental effects on dynamics of the walk on a line and an n-cycle highlighting the interplay between noise and topology. Using the properties and behavior of quantum walk discussed in part two, in part three we propose the application of quantum walk to realize quantum phase transition in optical lattice, that is to efficiently control and redistribute ultracold atoms in optical lattice. We also discuss the implementation scheme. Another application we consider is creation of spatial entanglement using quantum walk on a quantum many body system.

arXiv:1001.5326•Jan 29, 2010•14 citations

Discrete-Time Quantum Walk - Dynamics and Applications

Chandrashekar Madaiah

This dissertation presents investigations on dynamics of discrete-time quantum walk and some of its applications. Quantum walks has been exploited as an useful tool for quantum algorithms in quantum computing. Beyond quantum computational purposes, it has been used to explain and control the dynamics in various physical systems. In order to use the quantum walk to its fullest potential, it is important to know and optimize the properties purely due to quantum dynamics and in presence of noise. Various studies of its dynamics in the absence and presence of noise have been reported. We propose new approaches to optimize the dynamics, discuss symmetries and effect of noise on the quantum walk. Making use of its properties, we propose the use of quantum walk as an efficient new tool for various applications in physical systems and quantum information processing. \n \nIn the first and second part of this dissertation, we discuss evolution process of the quantum walks, propose and demonstrate the optimization of discrete-time quantum walk using quantum coin operation from SU(2) group and discuss some of its properties. \n \nWe investigate symmetry operations and environmental effects on dynamics of the walk on a line and an $n-$cycle highlighting the interplay between noise and topology. \n \nUsing the properties and behavior of quantum walk discussed in part two, in part three we propose the application of quantum walk to realize quantum phase transition in optical lattice, that is to efficiently control and redistribute ultracold atoms in optical lattice. We also discuss the implementation scheme. Another application we consider is creation of spatial entanglement using quantum walk on a quantum many body system.

•Jan 25, 2010•0 citations

Efficient Quantum Pseudorandomness

Fernando G. S. L. Brandão, Aram W. Harrow, Michał Horodecki

Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g., in computation, communication, and control. Fully random transformations require exponential time for either classical or quantum systems, but in many cases pseudorandom operations can emulate certain properties of truly random ones. Indeed, in the classical realm there is by now a well-developed theory regarding such pseudorandom operations. However, the construction of such objects turns out to be much harder in the quantum case. Here, we show that random quantum unitary time evolutions ("circuits") are a powerful source of quantum pseudorandomness. This gives for the first time a polynomial-time construction of quantum unitary designs, which can replace fully random operations in most applications, and shows that generic quantum dynamics cannot be distinguished from truly random processes. We discuss applications of our result to quantum information science, cryptography, and understanding the self-equilibration of closed quantum dynamics.

arXiv:1605.00713•Physical Review Letters•Apr 29, 2016•51 citations

Constructing Dynamical Symmetries for Quantum Computing: Applications to Coherent Dynamics in Coupled Quantum Dots

James Russell Hamilton, Raphael David Levine, F. Remacle

Dynamical symmetries, time-dependent operators that almost commute with the Hamiltonian, extend the role of ordinary symmetries. Motivated by progress in quantum technologies, we illustrate a practical algebraic approach to computing such time-dependent operators. Explicitly we expand them as a linear combination of time-independent operators with time-dependent coefficients. There are possible applications to the dynamics of systems of coupled coherent two-state systems, such as qubits, pumped by optical excitation and other addressing inputs. Thereby, the interaction of the system with the excitation is bilinear in the coherence between the two states and in the strength of the time-dependent excitation. The total Hamiltonian is a sum of such bilinear terms and of terms linear in the populations. The terms in the Hamiltonian form a basis for Lie algebra, which can be represented as coupled individual two-state systems, each using the population and the coherence between two states. Using the factorization approach of Wei and Norman, we construct a unitary quantum mechanical evolution operator that is a factored contribution of individual two-state systems. By that one can accurately propagate both the wave function and the density matrix with special relevance to quantum computing based on qubit architecture. Explicit examples are derived for the electronic dynamics in coupled semi-conducting nanoparticles that can be used as hardware for quantum technologies.

Nanomaterials•Dec 23, 2024•5 citations

Epsilon-Nets, Unitary Designs, and Random Quantum Circuits

Michał Oszmaniec, Adam Sawicki, Michał Horodecki

Epsilon-nets and approximate unitary$t$-designs are natural notions that capture properties of unitary operations relevant for numerous applications in quantum information and quantum computing. In this work we study quantitative connections between these two notions. Specifically, we prove that, for$d$dimensional Hilbert space, unitaries constituting$\delta $-approximate$t$-expanders form$\epsilon $-nets for$t\simeq \frac {d^{5/2}}{ \epsilon }$and$\delta \simeq \left ({\frac { \epsilon ^{3/2}}{d}}\right)^{d^{2}}$. We also show that for arbitrary$t$,$\epsilon $-nets can be used to construct$\delta $-approximate unitary$t$-designs for$\delta \simeq \epsilon t$, where the notion of approximation is based on the diamond norm. Finally, we prove that the degree of an exact unitary$t$design necessary to obtain an$\epsilon $-net must grow at least as fast as$\frac {1}{ \epsilon }$(for fixed dimension) and not slower than$d^{2}$(for fixed$\epsilon $). This shows near optimality of our result connecting$t$-designs and$\epsilon $-nets. We apply our findings in the context of quantum computing. First, we show that that approximate t-designs can be generated by shallow random circuits formed from a set of universal two-qudit gates in the parallel and sequential local architectures considered in (Brandão et al., 2016). Importantly, our gate sets need not to be symmetric (i.e., contains gates together with their inverses) or consist of gates with algebraic entries. Second, we consider compilation of quantum gates and prove a non-constructive Solovay-Kitaev theorem for general universal gate sets. Our main technical contribution is a new construction of efficient polynomial approximations to the Dirac delta in the space of quantum channels, which can be of independent interest.

arXiv:2007.10885•IEEE Transactions on Information Theory•Nov 13, 2021•27 citations
Discovering pragmatic and efficient approaches to construct ε-approximations of quantum operators such as real (imaginary) time-evolution propagators in terms of the basic quantum operations (gates) is challenging. Prior ε-approximations are invaluable, in that they enable the compilation of classical and quantum algorithm modeling of, e.g., dynamical and thermodynamic quantum properties. In parallel, symmetries are powerful tools concisely describing the fundamental laws of nature; the symmetric underpinnings of physical laws have consistently provided profound insights and substantially increased predictive power. In this work, we consider the interplay between the ε-approximate processes and the exact symmetries in a semicoherent context—where measurements occur at each logical clock cycle. We draw inspiration from Pascual Jordan's groundbreaking formulation of nonassociative, but commutative, symmetric algebraic form. Our symmetrized formalism is then applied in various domains such as quantum random walks, real-time evolutions, variational algorithm ansatzes, and efficient entanglement verification. Our work paves the way for a deeper understanding and greater appreciation of how symmetries can be used to control quantum dynamics in settings where coherence is a limited resource.
Symmetry principles have played a crucial role in the development of modern physics and underpin our most fundamental theories of nature. The present thesis is concerned with the analysis of symmetries in the context of quantum information theory. Whenever a quantum mechanical system interacts with its environment it is subjected to decoherence, a process that is typically irreversible and most generally treated abstractly using the concept of quantum operations. If there is an underlying symmetry principle, additional structures emerge. The central question we address is, What are the consequences of global or local gauge symmetry on the structure of many-body quantum processes?This leads us to a diagrammatic framework of decomposing quantum operations into terms that respond to the symmetry principle in particular ways and respect the causal structures involved. We present two core applications. First, we address the interplay between irreversibility and repeatable use of coherent resources under symmetry constraints. Second, we give an information-theoretic perspective on gauging globally symmetric dynamics to a local symmetry applicable even in the presence of irreversibility and thus it goes beyond the usual Lagrangian formulation. Finally, we analyse the departure from conservation laws under symmetric dynamics subject to decoherence.
This dissertation presents investigations on dynamics of discrete-time quantum walk and some of its applications. Quantum walks has been exploited as an useful tool for quantum algorithms in quantum computing. Beyond quantum computational purposes, it has been used to explain and control the dynamics in various physical systems. In order to use the quantum walk to its fullest potential, it is important to know and optimize the properties purely due to quantum dynamics and in presence of noise. Various studies of its dynamics in the absence and presence of noise have been reported. We propose new approaches to optimize the dynamics, discuss symmetries and effect of noise on the quantum walk. Making use of its properties, we propose the use of quantum walk as an efficient new tool for various applications in physical systems and quantum information processing. In the first and second part of this dissertation, we discuss evolution process of the quantum walks, propose and demonstrate the optimization of discrete-time quantum walk using quantum coin operation from SU(2) group and discuss some of its properties. We investigate symmetry operations and environmental effects on dynamics of the walk on a line and an n-cycle highlighting the interplay between noise and topology. Using the properties and behavior of quantum walk discussed in part two, in part three we propose the application of quantum walk to realize quantum phase transition in optical lattice, that is to efficiently control and redistribute ultracold atoms in optical lattice. We also discuss the implementation scheme. Another application we consider is creation of spatial entanglement using quantum walk on a quantum many body system.
This dissertation presents investigations on dynamics of discrete-time quantum walk and some of its applications. Quantum walks has been exploited as an useful tool for quantum algorithms in quantum computing. Beyond quantum computational purposes, it has been used to explain and control the dynamics in various physical systems. In order to use the quantum walk to its fullest potential, it is important to know and optimize the properties purely due to quantum dynamics and in presence of noise. Various studies of its dynamics in the absence and presence of noise have been reported. We propose new approaches to optimize the dynamics, discuss symmetries and effect of noise on the quantum walk. Making use of its properties, we propose the use of quantum walk as an efficient new tool for various applications in physical systems and quantum information processing. \n \nIn the first and second part of this dissertation, we discuss evolution process of the quantum walks, propose and demonstrate the optimization of discrete-time quantum walk using quantum coin operation from SU(2) group and discuss some of its properties. \n \nWe investigate symmetry operations and environmental effects on dynamics of the walk on a line and an n−n-n−cycle highlighting the interplay between noise and topology. \n \nUsing the properties and behavior of quantum walk discussed in part two, in part three we propose the application of quantum walk to realize quantum phase transition in optical lattice, that is to efficiently control and redistribute ultracold atoms in optical lattice. We also discuss the implementation scheme. Another application we consider is creation of spatial entanglement using quantum walk on a quantum many body system.
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g., in computation, communication, and control. Fully random transformations require exponential time for either classical or quantum systems, but in many cases pseudorandom operations can emulate certain properties of truly random ones. Indeed, in the classical realm there is by now a well-developed theory regarding such pseudorandom operations. However, the construction of such objects turns out to be much harder in the quantum case. Here, we show that random quantum unitary time evolutions ("circuits") are a powerful source of quantum pseudorandomness. This gives for the first time a polynomial-time construction of quantum unitary designs, which can replace fully random operations in most applications, and shows that generic quantum dynamics cannot be distinguished from truly random processes. We discuss applications of our result to quantum information science, cryptography, and understanding the self-equilibration of closed quantum dynamics.
Dynamical symmetries, time-dependent operators that almost commute with the Hamiltonian, extend the role of ordinary symmetries. Motivated by progress in quantum technologies, we illustrate a practical algebraic approach to computing such time-dependent operators. Explicitly we expand them as a linear combination of time-independent operators with time-dependent coefficients. There are possible applications to the dynamics of systems of coupled coherent two-state systems, such as qubits, pumped by optical excitation and other addressing inputs. Thereby, the interaction of the system with the excitation is bilinear in the coherence between the two states and in the strength of the time-dependent excitation. The total Hamiltonian is a sum of such bilinear terms and of terms linear in the populations. The terms in the Hamiltonian form a basis for Lie algebra, which can be represented as coupled individual two-state systems, each using the population and the coherence between two states. Using the factorization approach of Wei and Norman, we construct a unitary quantum mechanical evolution operator that is a factored contribution of individual two-state systems. By that one can accurately propagate both the wave function and the density matrix with special relevance to quantum computing based on qubit architecture. Explicit examples are derived for the electronic dynamics in coupled semi-conducting nanoparticles that can be used as hardware for quantum technologies.
Epsilon-nets and approximate unitaryttt-designs are natural notions that capture properties of unitary operations relevant for numerous applications in quantum information and quantum computing. In this work we study quantitative connections between these two notions. Specifically, we prove that, forddddimensional Hilbert space, unitaries constituting$\delta −approximate-approximate−approximatet−expandersform-expanders form−expandersform\epsilon −netsfor-nets for−netsfort\simeq \frac {d^{5/2}}{ \epsilon }andandand\delta \simeq \left ({\frac { \epsilon ^{3/2}}{d}}\right)^{d^{2}}.Wealsoshowthatforarbitrary. We also show that for arbitrary.Wealsoshowthatforarbitraryt,,,\epsilon −netscanbeusedtoconstruct-nets can be used to construct−netscanbeusedtoconstruct\delta −approximateunitary-approximate unitary−approximateunitaryt−designsfor-designs for−designsfor\delta \simeq \epsilon t,wherethenotionofapproximationisbasedonthediamondnorm.Finally,weprovethatthedegreeofanexactunitary, where the notion of approximation is based on the diamond norm. Finally, we prove that the degree of an exact unitary,wherethenotionofapproximationisbasedonthediamondnorm.Finally,weprovethatthedegreeofanexactunitarytdesignnecessarytoobtainandesign necessary to obtain andesignnecessarytoobtainan\epsilon −netmustgrowatleastasfastas-net must grow at least as fast as−netmustgrowatleastasfastas\frac {1}{ \epsilon }(forfixeddimension)andnotslowerthan(for fixed dimension) and not slower than(forfixeddimension)andnotslowerthand^{2}(forfixed(for fixed(forfixed\epsilon ).Thisshowsnearoptimalityofourresultconnecting). This shows near optimality of our result connecting).Thisshowsnearoptimalityofourresultconnectingt−designsand-designs and−designsand\epsilon $-nets. We apply our findings in the context of quantum computing. First, we show that that approximate t-designs can be generated by shallow random circuits formed from a set of universal two-qudit gates in the parallel and sequential local architectures considered in (Brandão et al., 2016). Importantly, our gate sets need not to be symmetric (i.e., contains gates together with their inverses) or consist of gates with algebraic entries. Second, we consider compilation of quantum gates and prove a non-constructive Solovay-Kitaev theorem for general universal gate sets. Our main technical contribution is a new construction of efficient polynomial approximations to the Dirac delta in the space of quantum channels, which can be of independent interest.