6 papers
Complexity of quantum state verification in the quantum linear systems problem
Rolando D. Somma, Yigit Subasi
We analyze the complexity of quantum state verification in the context of solving systems of linear equations of the form . We show that any quantum operation th…
Computing partition functions in the one clean qubit model
Anirban N. Chowdhury, Rolando D. Somma, Yigit Subasi
We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive semi-definite Hamiltonians, our method has expected ru…
Entanglement spectroscopy with a depth-two quantum circuit
Yigit Subasi, Lukasz Cincio, Patrick J. Coles
Noisy intermediate-scale quantum (NISQ) computers have gate errors and decoherence, limiting the depth of circuits that can be implemented on them. A strategy for NISQ algorithms i…
Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing
Yigit Subasi, Rolando D. Somma, Davide Orsucci
We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state that is proportion…
Improved implementation of reflection operators
Anirban Narayan Chowdhury, Yigit Subasi, Rolando D. Somma
Quantum algorithms for diverse problems, including search and optimization problems, require the implementation of a reflection operator over a target state. Commonly, such reflect…
Learning the quantum algorithm for state overlap
Lukasz Cincio, Yiğit Subaşı, Andrew T. Sornborger +1
Short-depth algorithms are crucial for reducing computational error on near-term quantum computers, for which decoherence and gate infidelity remain important issues. Here we prese…