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

Physica Scripta

Dynamical symmetry reduction and discrete tomography of a Ξ atom

Dylan H. Mahler, A. B. Klimov, Hubert de Guise

Published Sep 1, 2010• 10 citations
Publisher

Abstract

When implemented using a reasonable Hamiltonian, the tomography of a three-level Ξ atom is complicated by the equidistant energy levels of the atom. This restricts the possible transformations to those in the SO(3) subgroup of SU(3). Although complete reconstruction is possible for a single Ξ atom using a continuous set of tomograms, the discrete optimal set of tomograms, related to mutually unbiased bases in dimension 3, are not accessible by time evolution. We discuss here the search for an optimal set of discrete basis states compatible with the reduced SO(3) symmetry of the system.

DOI
10.1088/0031-8949/2010/t140/014026

Related papers

Quantum tomography of a system of three-level atoms

A. B. Klimov, Hubert de Guise

We analyze the possibility of tomographic reconstruction of a system of three-level atoms in both non-degenerate and degenerate cases. In the non-degenerate case (when both transitions can be accessed independently) a complete reconstruction is possible. In the degenerate case (when both transitions are excited simultaneously) the complete reconstruction is achievable only for a single atom in the Sigma configuration. For multiple Sigma atoms, or even a single atom in the Lambda configuration, only partial reconstruction is possible. Examples of one and two-atom cases are explicitly considered.

arXiv:0711.2765•Journal of Physics A Mathematical and Theoretical•Dec 19, 2007•4 citations

Quantum tomography via nonorthogonal basis and weak values

Juan J Díaz, Isabel Sainz, A. B. Klimov

Using a relation between a biorthogonal set of equiseparable bases and the weak values of the density matrix we derive an explicit formula for its tomographic reconstruction completely analogous to the standard mutually unbiased bases expansion.

arXiv:1602.04073•Physical Review A•Jun 26, 2015•4 citations

Quantum algorithms, symmetry, and Fourier analysis

Aaron Denney

I describe the role of symmetry in two quantum algorithms, with a focus on how that symmetry is made manifest by the Fourier transform. The Fourier transform can be considered in a wider context than the familiar one of functions on Rn or Z/nZ; instead it can be defined for an arbitrary group where it is known as representation theory. The first quantum algorithm solves an instance of the hidden subgroup problem--distinguishing conjugates of the Borel subgroup from each other in groups related to PSL(2; q). I use the symmetry of the subgroups under consideration to reduce the problem to a mild extension of a previously solved problem. This generalizes a result of Moore, Rockmore, Russel and Schulman[33] by switching to a more natural measurement that also applies to prime powers. In contrast to the first algorithm, the second quantum algorithm is an attempt to use naturally continuous spaces. Quantum walks have proved to be a useful tool for designing quantum algorithms. The natural equivalent to continuous time quantum walks is evolution with the Schrodinger equation, under the kinetic energy Hamiltonian for a massive particle. I take advantage of quantum interference to find the center of spherical shells in high dimensions. Any implementation would be likely to take place on a discrete grid, using the ability of a digital quantum computer to simulate the evolution of a quantum system. In addition, I use ideas from the second algorithm on a different set of starting states, and find that quantum evolution can be used to sample from the evolute of a plane curve. The method of stationary phase is used to determine scaling exponents characterizing the precision and probability of success for this procedure.

•Aug 27, 2012•0 citations

Experimental characterization of quantum processes: A selective and efficient method in arbitrary finite dimensions

Quimey Pears Stefano, Ignacio Perito, J. J. M. Varga +2 more

The temporal evolution of a quantum system can be characterized by quantum process tomography, a complex task that consumes a number of physical resources scaling exponentially with the number of subsystems. An alternative approach to the full reconstruction of a quantum channel is the selective and efficient quantum process tomography, a method that allows estimating, individually and up to the required accuracy, each element of the matrix that describes the process, using only a polynomial amount of resources. The implementation of this protocol is closely related to the possibility of building a complete set of mutually unbiased bases (MUBs), whose existence is known only when the dimension of the Hilbert space is the power of a prime number. However, an extension of the method that uses tensor products of maximal sets of MUBs has been recently introduced. Here we explicitly describe how to implement the algorithm for a selective and efficient estimation of a quantum process in a nonprime power dimension and conduct, an experimental verification of the method in a Hilbert space of dimension $d=6$. This is the smallest space for which a complete set of MUBs is not known to exist, but it can be decomposed as a tensor product of two Hilbert spaces of dimensions ${D}_{1}=2$ and ${D}_{2}=3$, in which a complete set of MUBs is already known. The six-dimensional states were codified in the discretized transverse linear momentum of photons. The state preparation and detection stages are dynamically programed with the use of only-phase spatial light modulators, in a versatile experimental setup that allows one to implement the algorithm in any finite dimension.

arXiv:2011.08228•Physical Review A•May 28, 2021•3 citations

SU(1,1) tomography

Giacomo Mauro D’Ariano, Ernesto De Vito, Lorenzo Maccone

We present a tomographic reconstruction procedure that exploits the symmetry of the SU(1,1) group existing in some physical systems. The tomographic algorithm is derived analytically and the convergence of the procedure is tested on Monte Carlo simulated data.

Physical Review A•Aug 13, 2001•7 citations

Reduction of quantum systems with symmetry, continuous and discrete

Toshihiro Iwai, Toru Hirose

Reduction of dynamical systems is closely related with symmetry. The purpose of this article is to show that Fourier analysis both on compact Lie groups and on finite groups serves as a reduction procedure for quantum systems with symmetry on an equal footing. The reduction procedure is applied to systems of many identical particles lying in R3 which admit the action of a rotation group SO(3) and of a symmetric or permutation group.

Journal of Mathematical Physics•Jun 1, 2002•3 citations
When implemented using a reasonable Hamiltonian, the tomography of a three-level Ξ atom is complicated by the equidistant energy levels of the atom. This restricts the possible transformations to those in the SO(3) subgroup of SU(3). Although complete reconstruction is possible for a single Ξ atom using a continuous set of tomograms, the discrete optimal set of tomograms, related to mutually unbiased bases in dimension 3, are not accessible by time evolution. We discuss here the search for an optimal set of discrete basis states compatible with the reduced SO(3) symmetry of the system.
We analyze the possibility of tomographic reconstruction of a system of three-level atoms in both non-degenerate and degenerate cases. In the non-degenerate case (when both transitions can be accessed independently) a complete reconstruction is possible. In the degenerate case (when both transitions are excited simultaneously) the complete reconstruction is achievable only for a single atom in the Sigma configuration. For multiple Sigma atoms, or even a single atom in the Lambda configuration, only partial reconstruction is possible. Examples of one and two-atom cases are explicitly considered.
I describe the role of symmetry in two quantum algorithms, with a focus on how that symmetry is made manifest by the Fourier transform. The Fourier transform can be considered in a wider context than the familiar one of functions on Rn or Z/nZ; instead it can be defined for an arbitrary group where it is known as representation theory. The first quantum algorithm solves an instance of the hidden subgroup problem--distinguishing conjugates of the Borel subgroup from each other in groups related to PSL(2; q). I use the symmetry of the subgroups under consideration to reduce the problem to a mild extension of a previously solved problem. This generalizes a result of Moore, Rockmore, Russel and Schulman[33] by switching to a more natural measurement that also applies to prime powers. In contrast to the first algorithm, the second quantum algorithm is an attempt to use naturally continuous spaces. Quantum walks have proved to be a useful tool for designing quantum algorithms. The natural equivalent to continuous time quantum walks is evolution with the Schrodinger equation, under the kinetic energy Hamiltonian for a massive particle. I take advantage of quantum interference to find the center of spherical shells in high dimensions. Any implementation would be likely to take place on a discrete grid, using the ability of a digital quantum computer to simulate the evolution of a quantum system. In addition, I use ideas from the second algorithm on a different set of starting states, and find that quantum evolution can be used to sample from the evolute of a plane curve. The method of stationary phase is used to determine scaling exponents characterizing the precision and probability of success for this procedure.
The temporal evolution of a quantum system can be characterized by quantum process tomography, a complex task that consumes a number of physical resources scaling exponentially with the number of subsystems. An alternative approach to the full reconstruction of a quantum channel is the selective and efficient quantum process tomography, a method that allows estimating, individually and up to the required accuracy, each element of the matrix that describes the process, using only a polynomial amount of resources. The implementation of this protocol is closely related to the possibility of building a complete set of mutually unbiased bases (MUBs), whose existence is known only when the dimension of the Hilbert space is the power of a prime number. However, an extension of the method that uses tensor products of maximal sets of MUBs has been recently introduced. Here we explicitly describe how to implement the algorithm for a selective and efficient estimation of a quantum process in a nonprime power dimension and conduct, an experimental verification of the method in a Hilbert space of dimension d=6d=6d=6. This is the smallest space for which a complete set of MUBs is not known to exist, but it can be decomposed as a tensor product of two Hilbert spaces of dimensions D1=2{D}_{1}=2D1​=2 and D2=3{D}_{2}=3D2​=3, in which a complete set of MUBs is already known. The six-dimensional states were codified in the discretized transverse linear momentum of photons. The state preparation and detection stages are dynamically programed with the use of only-phase spatial light modulators, in a versatile experimental setup that allows one to implement the algorithm in any finite dimension.