2022
DOI: 10.48550/arxiv.2209.14278
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Quantum Phase Processing: Transform and Extract Eigen-Information of Quantum Systems

Abstract: Quantum computing can provide speedups in solving many problems as the evolution of a quantum system is described by a unitary operator in an exponentially large Hilbert space. Such unitary operators change the phase of their eigenstates and make quantum algorithms fundamentally different from their classical counterparts. Based on this unique principle of quantum computing, we develop a new algorithmic framework "Quantum phase processing" that can directly apply arbitrary trigonometric transformations to eige… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(11 citation statements)
references
References 44 publications
0
11
0
Order By: Relevance
“…The core of our approaches has two steps: firstly, prepare an initial state with a considerable overlap, such as states generated by shallow-depth VQE, Gibbs-VQE [46], or Hartree-Fock states (which will be discussed in numerical experiments); secondly, use a quantum algorithm to project out the ground state from the initial state with high probability. The projection can be realised using the quantum algorithmic tool, namely the quantum phase search algorithm (QPS) [43], which can classify the eigenvectors of a unitary operator. Using QPS, the probability of sampling the ground state is highly approximate to the initial overlap.…”
Section: Ground State Preparationmentioning
confidence: 99%
See 4 more Smart Citations
“…The core of our approaches has two steps: firstly, prepare an initial state with a considerable overlap, such as states generated by shallow-depth VQE, Gibbs-VQE [46], or Hartree-Fock states (which will be discussed in numerical experiments); secondly, use a quantum algorithm to project out the ground state from the initial state with high probability. The projection can be realised using the quantum algorithmic tool, namely the quantum phase search algorithm (QPS) [43], which can classify the eigenvectors of a unitary operator. Using QPS, the probability of sampling the ground state is highly approximate to the initial overlap.…”
Section: Ground State Preparationmentioning
confidence: 99%
“…The phase factors φ, θ, and ω are chosen such that the circuit implements a trigonometric polynomial transformation to each phase of the unitary, i.e., f : λ → L j=−L c j e ijλ , where each c j ∈ C and satisfies j |c j | ≤ 1. For a certain trigonometric polynomial, the corresponding factors can be classically computed beforehand [43,48]. The action of running the circuit to an eigenvector of the unitary U is presented in the lemma below.…”
Section: A Algorithm Using Real-time Hamiltonian Evolutionmentioning
confidence: 99%
See 3 more Smart Citations