### Abstract

The success probability in an ancilla-based circuit generally decreases exponentially in the number of qubits consisted in the ancilla. Although the probability can be amplified through the amplitude amplification process, the input dependence of the amplitude amplification makes difficult to sequentially combine two or more ancilla-based circuits. A new version of the amplitude amplification known as the oblivious amplitude amplification runs independently of the input to the system register. This allows us to sequentially combine two or more ancilla-based circuits. However, this type of the amplification only works when the considered system is unitary or non-unitary but somehow close to a unitary. In this paper, we present a general framework to simulate non-unitary processes on ancilla-based quantum circuits in which the success probability is maximized by using the oblivious amplitude amplification. In particular, we show how to extend a non-unitary matrix to an almost unitary matrix. We then employ the extended matrix by using an ancilla-based circuit design along with the oblivious amplitude amplification. Measuring the distance of the produced matrix to the closest unitary matrix, a lower bound for the fidelity of the final state obtained from the oblivious amplitude amplification process is presented. Numerical simulations for random matrices of different sizes show that independent of the system size, the final amplified probabilities are generally around 0.75 and the fidelity of the final state is mostly high and around 0.95. Furthermore, we discuss the complexity analysis and show that combining two such ancilla-based circuits, a matrix product can be implemented. This may lead us to efficiently implement matrix functions represented as infinite matrix products on quantum computers.

Original language | English |
---|---|

Article number | 33 |

Journal | Quantum Information Processing |

Volume | 16 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1 Jan 2017 |

### Fingerprint

### Keywords

- Matrix functions
- Oblivious amplitude amplification
- Phase estimation algorithm
- Quantum circuits

### ASJC Scopus subject areas

- Statistical and Nonlinear Physics
- Theoretical Computer Science
- Electronic, Optical and Magnetic Materials
- Signal Processing
- Modelling and Simulation
- Electrical and Electronic Engineering

### Cite this

**An ancilla-based quantum simulation framework for non-unitary matrices.** / Daskin, Ammar; Kais, Sabre.

Research output: Contribution to journal › Article

*Quantum Information Processing*, vol. 16, no. 1, 33. https://doi.org/10.1007/s11128-016-1452-3

}

TY - JOUR

T1 - An ancilla-based quantum simulation framework for non-unitary matrices

AU - Daskin, Ammar

AU - Kais, Sabre

PY - 2017/1/1

Y1 - 2017/1/1

N2 - The success probability in an ancilla-based circuit generally decreases exponentially in the number of qubits consisted in the ancilla. Although the probability can be amplified through the amplitude amplification process, the input dependence of the amplitude amplification makes difficult to sequentially combine two or more ancilla-based circuits. A new version of the amplitude amplification known as the oblivious amplitude amplification runs independently of the input to the system register. This allows us to sequentially combine two or more ancilla-based circuits. However, this type of the amplification only works when the considered system is unitary or non-unitary but somehow close to a unitary. In this paper, we present a general framework to simulate non-unitary processes on ancilla-based quantum circuits in which the success probability is maximized by using the oblivious amplitude amplification. In particular, we show how to extend a non-unitary matrix to an almost unitary matrix. We then employ the extended matrix by using an ancilla-based circuit design along with the oblivious amplitude amplification. Measuring the distance of the produced matrix to the closest unitary matrix, a lower bound for the fidelity of the final state obtained from the oblivious amplitude amplification process is presented. Numerical simulations for random matrices of different sizes show that independent of the system size, the final amplified probabilities are generally around 0.75 and the fidelity of the final state is mostly high and around 0.95. Furthermore, we discuss the complexity analysis and show that combining two such ancilla-based circuits, a matrix product can be implemented. This may lead us to efficiently implement matrix functions represented as infinite matrix products on quantum computers.

AB - The success probability in an ancilla-based circuit generally decreases exponentially in the number of qubits consisted in the ancilla. Although the probability can be amplified through the amplitude amplification process, the input dependence of the amplitude amplification makes difficult to sequentially combine two or more ancilla-based circuits. A new version of the amplitude amplification known as the oblivious amplitude amplification runs independently of the input to the system register. This allows us to sequentially combine two or more ancilla-based circuits. However, this type of the amplification only works when the considered system is unitary or non-unitary but somehow close to a unitary. In this paper, we present a general framework to simulate non-unitary processes on ancilla-based quantum circuits in which the success probability is maximized by using the oblivious amplitude amplification. In particular, we show how to extend a non-unitary matrix to an almost unitary matrix. We then employ the extended matrix by using an ancilla-based circuit design along with the oblivious amplitude amplification. Measuring the distance of the produced matrix to the closest unitary matrix, a lower bound for the fidelity of the final state obtained from the oblivious amplitude amplification process is presented. Numerical simulations for random matrices of different sizes show that independent of the system size, the final amplified probabilities are generally around 0.75 and the fidelity of the final state is mostly high and around 0.95. Furthermore, we discuss the complexity analysis and show that combining two such ancilla-based circuits, a matrix product can be implemented. This may lead us to efficiently implement matrix functions represented as infinite matrix products on quantum computers.

KW - Matrix functions

KW - Oblivious amplitude amplification

KW - Phase estimation algorithm

KW - Quantum circuits

UR - http://www.scopus.com/inward/record.url?scp=85006973178&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85006973178&partnerID=8YFLogxK

U2 - 10.1007/s11128-016-1452-3

DO - 10.1007/s11128-016-1452-3

M3 - Article

AN - SCOPUS:85006973178

VL - 16

JO - Quantum Information Processing

JF - Quantum Information Processing

SN - 1570-0755

IS - 1

M1 - 33

ER -