A universal quantum circuit scheme for finding complex eigenvalues

DOI10.1007/s11128-013-0654-1zbMath1291.81093arXiv1302.0579OpenAlexW2153805000WikidataQ59457294 ScholiaQ59457294MaRDI QIDQ2454202

Ananth Grama, Sabre Kais, Anmer Daskin

Publication date: 13 June 2014

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.0579

zbMATH Keywords

quantum algorithmscomplex eigenvaluesphase estimationquantum circuitsresonance states

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

Obtaining a linear combination of the principal components of a matrix on quantum computers ⋮ An ancilla-based quantum simulation framework for non-unitary matrices ⋮ Multiple network alignment on quantum computers

Cites Work

• On the efficiency of quantum algorithms for Hamiltonian simulation
• Using quantum computers for quantum simulation
• Efficient quantum algorithms for simulating sparse Hamiltonians
• A regularized integral equation method for the inverse geometry heat conduction problem
• Non-Hermitian Quantum Mechanics
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Strengths and Weaknesses of Quantum Computing
• Quantum-circuit design for efficient simulations of many-body quantum dynamics
• NONUNITARY QUANTUM CIRCUIT
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A universal quantum circuit scheme for finding complex eigenvalues