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:quant-ph/0104107 · Physical Review A

Singlet states and the estimation of eigenstates and eigenvalues of an unknown controlled- U gate

Mark S. Hillery, Vladimír Bužek

Published Sep 10, 2001• 16 citations
arXivHTMLPDF

Abstract

We consider several problems that involve finding the eigenvalues and generating the eigenstates of unknown unitary gates. We first examine controlled-$U$ gates that act on qubits and assume that we know the eigenvalues. It is then shown how to use singlet states to produce qubits in the eigenstates of the gate. We then remove the assumption that we know the eigenvalues and show how to both find the eigenvalues and produce qubits in the eigenstates. Finally, we look at the case where the unitary operation acts on qutrits and it has two eigenvalues of $1$ and one of $\ensuremath{-}1.$ We are able to use a singlet state to produce a qutrit in the eigenstate corresponding to the $\ensuremath{-}1$ eigenvalue.

DOI
10.1103/physreva.64.042303

Related papers

Estimation of Quantum States and Operations

Ballester Sánchez, Manuel Alberto

The subject of this thesis, quantum estimation theory, is inspired by recent developments, both practical and theoretical, in the new field of quantum information and computation. The main task of quantum estimation theory, the subject of this thesis, is that given many identical copies of an unknown quantum system one wants to "guess" or estimate what the system is. This is done by performing an "optimal" measurement and analyzing the data obtained from it. A quantum state is represented by a density matrix. In some cases one does not need to know the whole density matrix, sometimes a partial characterization is enough. Chapter 2 of this thesis is about optimally estimating the spectrum, i.e. the eigenvalues, of a density matrix. This is useful, for example, for estimating the entanglement of a bipartite pure state. The results of chapter 2 tell us that one can optimally estimate bipartite entanglement with LOCC measurements on one of the two parties. Unitary operations transform density matrices to density matrices. They are the gates of quantum information processing. Suppose one has one such unitary operation but one does not know what it does. In order to characterize it one needs to know how it transforms any input state. In order to know how a particular state is transformed, one can prepare that state, feed it to the unitary many times, and measure the output. One state is, of course, not enough. It turns out that the unitary can be completely characterized with a finite set of states, this is known as quantum process tomography. Unfortunately, in many cases it is difficult to have available in the lab all the input states needed to perform quantum process tomography. It is here where entanglement comes to the rescue. One pair of maximally entangled qubits, where one of them is used as input for the unitary gate and the other is left untouched, is sufficient. All the information about the unknown gate is contained in the joint output state. This is the problem treated in chapter 3. Now the output state needs to be measured. Again, one could measure the two qubits separately (LOCC) or jointly (collective measurement). Is there anything to gain by performing joint measurements? The answer is yes, optimal collective measurements are at least 3 times more accurate than any LOCC measurement. Chapter 4 treats the problem of estimating commuting unitary gates. There it is shown that this extra information makes it unnecessary to use an entangled input state and to use collective measurements at the output. In chapters 3 and 4 it is assumed that only one copy of the unitary gate is available. If, however, more than one copy (say N ) are available at the same time one could use an N-fold entangled state as input. If no entanglement is used, classical statistics tells us that the error of the estimation is proportional to 1/√N. In the literature, it has been shown that by using an entangled state in the input one can achieve an error proportional to 1/N. However, this has been shown only for qubit gates. In chapter 5 important steps are taken in the direction of showing the same thing for a general unitary gate, but this remains an open problem.

•Jan 1, 2001•4 citations

Controlled gate networks: theory and application to eigenvalue estimation

Max Bee-Lindgren, Zhengrong Qian, Matthew P. DeCross +5 more

Abstract We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates. We present the general theory of controlled gate networks and show that, under quite general conditions, it can significantly reduce the number of two-qubit gates needed to produce linear combinations of unitary operators. The first example we consider is a variational subspace calculation for a two-qubit system. The second example is estimating the eigenvalues of a two-qubit Hamiltonian via the rodeo algorithm (Choi et al. in Phys Rev Lett 127(4):040505, 2021. https://doi.org/10.1103/PhysRevLett.127.040505 ) using operators that we call controlled reversal gates. We use the Quantinuum H1-2 and IBM Perth devices to realize the quantum circuits. The third example is the application of controlled gate networks to the controlled time evolution of a free nucleon on a three-dimensional lattice. For all of the examples, we show very substantial reductions in the number of two-qubit gates required. Our work demonstrates that controlled gate networks are a useful tool for reducing gate complexity in quantum algorithms for quantum many-body problems such as those relevant to nuclear physics.

arXiv:2208.13557•The European Physical Journal A•Nov 21, 2025•20 citations

Quantum algorithm for finding periodicities in the spectrum of a black-box Hamiltonian or unitary transformation

Dominik Janzing, Thomas Beth

Estimating the eigenvalues of a unitary transformation U by standard phase estimation requires the implementation of controlled-U-gates which are not available if U is only given as a black box. We show that a simple trick allows to measure eigenvalues of U\otimes U^\dagger even in this case. Running the algorithm several times allows therefore to estimate the autocorrelation function of the density of eigenstates of U. This can be applied to find periodicities in the energy spectrum of a quantum system with unknown Hamiltonian if it can be coupled to a quantum computer.

arXiv:quant-ph/0108053•Aug 10, 2001•6 citations

Resolvent-based quantum phase estimation: Towards estimation of parametrized eigenvalues

Abhijeet Alase, Salini Karuvade

Quantum algorithms for estimating the eigenvalues of matrices, including the phase estimation algorithm, serve as core subroutines in a wide range of quantum algorithms, including those in quantum chemistry and quantum machine learning. The standard quantum eigenvalue (phase) estimation algorithm accepts a Hermitian (unitary) matrix and a state in an unknown superposition of its eigenstates as input, and coherently records the estimates for real eigenvalues (eigenphases) in an ancillary register. Extension of quantum eigenvalue and phase estimation algorithms to the case of non-normal input matrices is obstructed by several factors such as non-orthogonality of eigenvectors, existence of generalized eigenvectors and the fact that eigenvalues may lie anywhere on the complex plane. In this work, we propose a novel approach for estimating the eigenvalues of non-normal matrices based on preparation of a state that we call the "resolvent state". We construct the first efficient algorithm for estimating the phases of the unimodular eigenvalues of a given non-unitary matrix. We then construct an efficient algorithm for estimating the real eigenvalues of a given non-Hermitian matrix, achieving complexities that match the best known results while operating under significantly relaxed assumptions on the non-real part of the spectrum. The resolvent-based approach that we introduce also extends to estimating eigenvalues that lie on a parametrized complex curve, subject to explicitly stated conditions, thereby paving the way for a new paradigm of parametric eigenvalue estimation.

arXiv:2410.04837•Oct 7, 2024•7 citations

Robust controllability of two-qubit Hamiltonian dynamics

Ryosuke Sakai, Akihito Soeda, Mio Murao +1 more

Physically, quantum gates (unitary gates) for quantum computation are implemented by controlling the Hamiltonian dynamics of quantum systems. When full descriptions of the Hamiltonians are given, the set of implementable quantum gates is easily characterized by quantum control theory. In many real systems, however, the Hamiltonians may include unknown parameters due to the difficulty of performing precise measurements or instability of the system. In this paper, we consider the situation that some parameters of the Hamiltonian are unknown, but we still want to perform a robust control of the Hamiltonian dynamics to implement a quantum gate irrespectively to the unknown parameters. The existence of the robust control was previously shown for single-qubit systems, and a constructive method was developed for two-qubit systems if a full control of each qubit is available. We analytically investigate the robust controllability of two-qubit systems, and apply Lie-algebraic approaches to handle the cases where only one of the two qubits is controllable. We also numerically analyze the robust controllability of the two-qubit systems where the analytical approach is not necessarily applicable and investigate the relationship between the robust controllability of systems with a discrete and continuous unknown parameter.

arXiv:1903.09452•Physical Review A•Oct 8, 2019•6 citations

A simpler algorithm to mark the unknown eigenstates

Avatar Tulsi

For an unknown eigenstate $|ψ\rangle$ of a unitary operator $U$, suppose we have an estimate of the corresponding eigenvalue which is separated from all other eigenvalues by a minimum gap of magnitude $Δ$. In the eigenstate-marking problem (EMP), the goal is to implement a selective phase transformation of the $|ψ\rangle$ state (known as \emph{marking} the $|ψ\rangle$ state in the language of the quantum search algorithms). The EMP finds important applications in the construction of several quantum algorithms. The best known algorithm for the EMP combines the ideas of the phase estimation algorithm and the majority-voting. It uses $Θ(\frac{1}Δ\ln \frac{1}ε)$ applications of $U$ where $ε$ is the tolerable error. It needs $Θ\left(\ln \frac{1}Δ\right)$ ancilla qubits for the phase estimation and another $Θ\left(\ln \frac{1}ε\right)$ ancilla qubits for the majority-voting. In this paper, we show that the majority-voting is not a crucial requirement for the EMP and the same purpose can also be achieved using the fixed-point quantum search algorithm which does not need any ancilla qubits. In the case of majority-voting, these ancilla qubits were needed to do controlled transformations which are harder to implement physically. Using fixed-point quantum search, we get rid off these $Θ\left(\ln \frac{1}ε\right)$ ancilla qubits and same number of controlled transformations. Thus we get a much simpler algorithm for marking the unknown eigenstates. However, the required number of applications of $U$ increases by the factor of $Θ\left(\ln \frac{1}ε\right)$. This tradeoff can be beneficial in typical situations where spatial resources are more constrained or where the controlled transformations are very expensive.

arXiv:1611.02680•Nov 8, 2016•0 citations
We consider several problems that involve finding the eigenvalues and generating the eigenstates of unknown unitary gates. We first examine controlled-UUU gates that act on qubits and assume that we know the eigenvalues. It is then shown how to use singlet states to produce qubits in the eigenstates of the gate. We then remove the assumption that we know the eigenvalues and show how to both find the eigenvalues and produce qubits in the eigenstates. Finally, we look at the case where the unitary operation acts on qutrits and it has two eigenvalues of 111 and one of \ensuremath−1.\ensuremath{-}1.\ensuremath−1. We are able to use a singlet state to produce a qutrit in the eigenstate corresponding to the \ensuremath−1\ensuremath{-}1\ensuremath−1 eigenvalue.
The subject of this thesis, quantum estimation theory, is inspired by recent developments, both practical and theoretical, in the new field of quantum information and computation. The main task of quantum estimation theory, the subject of this thesis, is that given many identical copies of an unknown quantum system one wants to "guess" or estimate what the system is. This is done by performing an "optimal" measurement and analyzing the data obtained from it. A quantum state is represented by a density matrix. In some cases one does not need to know the whole density matrix, sometimes a partial characterization is enough. Chapter 2 of this thesis is about optimally estimating the spectrum, i.e. the eigenvalues, of a density matrix. This is useful, for example, for estimating the entanglement of a bipartite pure state. The results of chapter 2 tell us that one can optimally estimate bipartite entanglement with LOCC measurements on one of the two parties. Unitary operations transform density matrices to density matrices. They are the gates of quantum information processing. Suppose one has one such unitary operation but one does not know what it does. In order to characterize it one needs to know how it transforms any input state. In order to know how a particular state is transformed, one can prepare that state, feed it to the unitary many times, and measure the output. One state is, of course, not enough. It turns out that the unitary can be completely characterized with a finite set of states, this is known as quantum process tomography. Unfortunately, in many cases it is difficult to have available in the lab all the input states needed to perform quantum process tomography. It is here where entanglement comes to the rescue. One pair of maximally entangled qubits, where one of them is used as input for the unitary gate and the other is left untouched, is sufficient. All the information about the unknown gate is contained in the joint output state. This is the problem treated in chapter 3. Now the output state needs to be measured. Again, one could measure the two qubits separately (LOCC) or jointly (collective measurement). Is there anything to gain by performing joint measurements? The answer is yes, optimal collective measurements are at least 3 times more accurate than any LOCC measurement. Chapter 4 treats the problem of estimating commuting unitary gates. There it is shown that this extra information makes it unnecessary to use an entangled input state and to use collective measurements at the output. In chapters 3 and 4 it is assumed that only one copy of the unitary gate is available. If, however, more than one copy (say N ) are available at the same time one could use an N-fold entangled state as input. If no entanglement is used, classical statistics tells us that the error of the estimation is proportional to 1/√N. In the literature, it has been shown that by using an entangled state in the input one can achieve an error proportional to 1/N. However, this has been shown only for qubit gates. In chapter 5 important steps are taken in the direction of showing the same thing for a general unitary gate, but this remains an open problem.
Abstract We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates. We present the general theory of controlled gate networks and show that, under quite general conditions, it can significantly reduce the number of two-qubit gates needed to produce linear combinations of unitary operators. The first example we consider is a variational subspace calculation for a two-qubit system. The second example is estimating the eigenvalues of a two-qubit Hamiltonian via the rodeo algorithm (Choi et al. in Phys Rev Lett 127(4):040505, 2021. https://doi.org/10.1103/PhysRevLett.127.040505 ) using operators that we call controlled reversal gates. We use the Quantinuum H1-2 and IBM Perth devices to realize the quantum circuits. The third example is the application of controlled gate networks to the controlled time evolution of a free nucleon on a three-dimensional lattice. For all of the examples, we show very substantial reductions in the number of two-qubit gates required. Our work demonstrates that controlled gate networks are a useful tool for reducing gate complexity in quantum algorithms for quantum many-body problems such as those relevant to nuclear physics.
Estimating the eigenvalues of a unitary transformation U by standard phase estimation requires the implementation of controlled-U-gates which are not available if U is only given as a black box. We show that a simple trick allows to measure eigenvalues of U\otimes U^\dagger even in this case. Running the algorithm several times allows therefore to estimate the autocorrelation function of the density of eigenstates of U. This can be applied to find periodicities in the energy spectrum of a quantum system with unknown Hamiltonian if it can be coupled to a quantum computer.
Quantum algorithms for estimating the eigenvalues of matrices, including the phase estimation algorithm, serve as core subroutines in a wide range of quantum algorithms, including those in quantum chemistry and quantum machine learning. The standard quantum eigenvalue (phase) estimation algorithm accepts a Hermitian (unitary) matrix and a state in an unknown superposition of its eigenstates as input, and coherently records the estimates for real eigenvalues (eigenphases) in an ancillary register. Extension of quantum eigenvalue and phase estimation algorithms to the case of non-normal input matrices is obstructed by several factors such as non-orthogonality of eigenvectors, existence of generalized eigenvectors and the fact that eigenvalues may lie anywhere on the complex plane. In this work, we propose a novel approach for estimating the eigenvalues of non-normal matrices based on preparation of a state that we call the "resolvent state". We construct the first efficient algorithm for estimating the phases of the unimodular eigenvalues of a given non-unitary matrix. We then construct an efficient algorithm for estimating the real eigenvalues of a given non-Hermitian matrix, achieving complexities that match the best known results while operating under significantly relaxed assumptions on the non-real part of the spectrum. The resolvent-based approach that we introduce also extends to estimating eigenvalues that lie on a parametrized complex curve, subject to explicitly stated conditions, thereby paving the way for a new paradigm of parametric eigenvalue estimation.
Physically, quantum gates (unitary gates) for quantum computation are implemented by controlling the Hamiltonian dynamics of quantum systems. When full descriptions of the Hamiltonians are given, the set of implementable quantum gates is easily characterized by quantum control theory. In many real systems, however, the Hamiltonians may include unknown parameters due to the difficulty of performing precise measurements or instability of the system. In this paper, we consider the situation that some parameters of the Hamiltonian are unknown, but we still want to perform a robust control of the Hamiltonian dynamics to implement a quantum gate irrespectively to the unknown parameters. The existence of the robust control was previously shown for single-qubit systems, and a constructive method was developed for two-qubit systems if a full control of each qubit is available. We analytically investigate the robust controllability of two-qubit systems, and apply Lie-algebraic approaches to handle the cases where only one of the two qubits is controllable. We also numerically analyze the robust controllability of the two-qubit systems where the analytical approach is not necessarily applicable and investigate the relationship between the robust controllability of systems with a discrete and continuous unknown parameter.
For an unknown eigenstate ∣ψ⟩|ψ\rangle∣ψ⟩ of a unitary operator UUU, suppose we have an estimate of the corresponding eigenvalue which is separated from all other eigenvalues by a minimum gap of magnitude ΔΔΔ. In the eigenstate-marking problem (EMP), the goal is to implement a selective phase transformation of the ∣ψ⟩|ψ\rangle∣ψ⟩ state (known as \emph{marking} the ∣ψ⟩|ψ\rangle∣ψ⟩ state in the language of the quantum search algorithms). The EMP finds important applications in the construction of several quantum algorithms. The best known algorithm for the EMP combines the ideas of the phase estimation algorithm and the majority-voting. It uses Θ(1Δln⁡1ε)Θ(\frac{1}Δ\ln \frac{1}ε)Θ(Δ1​lnε1​) applications of UUU where εεε is the tolerable error. It needs Θ(ln⁡1Δ)Θ\left(\ln \frac{1}Δ\right)Θ(lnΔ1​) ancilla qubits for the phase estimation and another Θ(ln⁡1ε)Θ\left(\ln \frac{1}ε\right)Θ(lnε1​) ancilla qubits for the majority-voting. In this paper, we show that the majority-voting is not a crucial requirement for the EMP and the same purpose can also be achieved using the fixed-point quantum search algorithm which does not need any ancilla qubits. In the case of majority-voting, these ancilla qubits were needed to do controlled transformations which are harder to implement physically. Using fixed-point quantum search, we get rid off these Θ(ln⁡1ε)Θ\left(\ln \frac{1}ε\right)Θ(lnε1​) ancilla qubits and same number of controlled transformations. Thus we get a much simpler algorithm for marking the unknown eigenstates. However, the required number of applications of UUU increases by the factor of Θ(ln⁡1ε)Θ\left(\ln \frac{1}ε\right)Θ(lnε1​). This tradeoff can be beneficial in typical situations where spatial resources are more constrained or where the controlled transformations are very expensive.