betaFeedback

WorksPhysics and Astronomy

Two-Unitary Decomposition Algorithm and Open Quantum System Simulation

Abstract

Simulating general quantum processes that describe realistic interactions of quantum systems following a non-unitary evolution is challenging for conventional quantum computers that directly implement unitary gates. We analyze complexities for promising methods such as the Sz.-Nagy dilation and linear combination of unitaries that can simulate open systems by the probabilistic realization of non-unitary operators, requiring multiple calls to both the encoding and state preparation oracles. We propose a quantum two-unitary decomposition (TUD) algorithm to decompose a dd-dimensional operator AA with non-zero singular values as A=(U1+U2)/2A=(U_1+U_2)/2 using the quantum singular value transformation algorithm, avoiding classically expensive singular value decomposition (SVD) with an O(d3)O(d^3) overhead in time. The two unitaries can be deterministically implemented, thus requiring only a single call to the state preparation oracle for each. The calls to the encoding oracle can also be reduced significantly at the expense of an acceptable error in measurements. Since the TUD method can be used to implement non-unitary operators as only two unitaries, it also has potential applications in linear algebra and quantum machine learning.

Introduction

In the early 1980s Manin [1] and Feynman [2] independently proposed that in order to circumvent the prohibitive scaling in the simulation of quantum systems, one would need a device that operates according to the principles of quantum mechanics. These considerations gave birth to the field that we now call quantum computing [3]. Since then an entire zoo of quantum algorithms for simulating quantum processes has emerged, some of them promise spectacular improvements over their classical alternatives, even exponential speedups [3, 4, 5, 6, 7, 8]. However, most of these prominent quantum algorithms are solely tailored for unitary simulations of isolated quantum phenomena. Since such a quantum device is universal in its computational nature, one may expect that its applicability reaches beyond the standard unitary framework.

In general, quantum systems of interest are rarely isolated as they are exposed to the inevitable influence of their environments. The environment consists of inaccessible degrees of freedom of the system’s natural surroundings as well as from the control devices that can become entangled with the system, ultimately leading to a loss of information. Therefore, the dynamics of a general quantum process must be described by a non-unitary, open quantum evolution [3, 9, 10, 11]. Understanding open quantum dynamics is indispensable to the study of dissipation and decoherence in quantum systems and therefore, noise in quantum circuits [12, 13, 14, 15, 16, 17], and is fundamental to a wide variety of phenomena such as thermalization [18, 19], non-equilibrium steady states [20, 21, 22], transport in strongly correlated systems [23, 24] as well as applications in quantum biology [25, 26, 27] [28]. Moreover, open quantum dynamics can be harnessed to perform universal quantum computation [29, 30] and prepare topological [31, 32, 33] as well as entangled states [34, 35, 36, 37]. Simulating the dynamics of open quantum systems is vital to understanding these processes.

Unlike isolated quantum evolution, open quantum evolution is non-unitary and thus presents a challenge for conventional quantum computers that are capable of directly implementing unitary gates. Quantum algorithms such as trotterization of Lindbladians [38, 39, 40, 41] and simulation of Markovian open dynamics from a set of universal channels [42, 43] rely on dilation techniques of encoding a non-unitary operator in a larger unitary. Recent advances have lead to promising methods such as the Sz.-Nagy encoding, which provides a minimal dilation [26] [44, 45, 46]. Another useful method for realizing a non-unitary operator is by implementing it as a linear combination of unitaries (LCU) [47, 48], recently used to simulate Lindblad evolution [49]. In Ref. [50], the authors propose implementing an arbitrary operator as a linear combination of four unitaries created by approximate operator exponentiation. A recent work [51] implements the non-unitary operators in the singular basis by calculating the singular value decomposition (SVD) classically, thus incurring significant overhead for large systems. Additionally, non-unitary operators may be implemented via a combination of unitary operations and measurements requiring a feedback loop [52, 53], imaginary time evolution algorithms [54, 55, 56] that need quantum tomography at each step, and even with methods that use the intrinsic dissipation of the quantum computer [57].

In this article, we first analyze prominent techniques such as the Stinespring dilation, the Sz.-Nagy dilation and the LCU method and discuss their implementation of non-unitary operators to simulate open quantum dynamics and calculate expectation values of observables. The Sz.-Nagy and LCU methods implement the dynamical map by the probabilistic realization of each non-unitary Kraus operator individually. We estimate the number of encoding oracle calls, state preparation oracle calls, and auxiliary qubits required for successful implementation of individual operators in the dynamical map. We provide a fully quantum method to estimate the expectation value of an observable to a specified confidence level, improving on previous methods that use Cholesky decomposition, which incurs O(d3)O(d^3) of classical overhead, where dd is the dimension. In particular, given an initial state ∣ψ⟩|\psi\rangle prepared by the state preparation oracle S\mathcal{S} and a contraction operator AA block encoded as an isometry (unitary) UAU_A, the state A∣ψ⟩/pA|\psi\rangle/\sqrt{p} where p=⟨ψ∣A†A∣ψ⟩p=\langle\psi|A^\dagger A|\psi\rangle, 0≤p≤10\leq p\leq1, can be successfully implemented with probability at least 1−β1-\beta using O(1/plog⁡(1/β))O(1/p\log(1/\beta)) calls to both UAU_A and S\mathcal{S}. For realistic cases of interest such as the amplitude damping channel, a particular Kraus operator can have p≪1p\ll1 which leads to a large number of calls to both UAU_A and S\mathcal{S}, which can be especially limiting if the initial state is difficult to prepare.

We provide a quantum algorithm to decompose any arbitrary dd-dimensional contraction operator AA (∥A∥≤1\lVert A\rVert\le1)1, with non-zero singular values into two unitaries such that A=(U1+U2)/2A=(U_1+U_2)/2 using the quantum singular value transformation (QSVT) algorithm [5] [58, 59, 60], without explicitly computing the SVD, which has O(d3)O(d^3) of classical overhead. Given a state ∣ψ⟩\lvert\psi\rangle prepared by S\mathcal{S} and a block encoding UAU_A of an arbitrary operator AA, our two-unitary decomposition (TUD) algorithm implements U~1∣ψ⟩,U~2∣ψ⟩\widetilde{U}_1\lvert\psi\rangle,\widetilde{U}_2\lvert\psi\rangle which are ϵ\epsilon approximations of U1∣ψ⟩,U2∣ψ⟩U_1\lvert\psi\rangle,U_2\lvert\psi\rangle with probability at least 1−β1-\beta using O(log⁡(1/β))O(\log(1/\beta)) calls to S\mathcal{S}, and O(1/δlog⁡(1/ϵ)log⁡(1/β))O(1/\delta\log(1/\epsilon)\log(1/\beta)) calls to UAU_A and UA†U_A^\dagger, where the singular values σi\sigma_i of AA are such that σi∈[δ,1−δ] ∀i\sigma_i\in[\delta,1-\delta]\ \forall i. Therefore, instead of implementing A∣ψ⟩A\lvert\psi\rangle directly which is probabilistic, the TUD algorithm implements U~1∣ψ⟩\widetilde{U}_1\lvert\psi\rangle and U~2∣ψ⟩\widetilde{U}_2\lvert\psi\rangle deterministically with each requiring approximately one use of state preparation oracle S\mathcal{S} or a single shot of ∣ψ⟩\lvert\psi\rangle. This is a considerable improvement from the previously needed O(1/plog⁡(1/β))O(1/p\log(1/\beta)) calls to S\mathcal{S}. We show that the unitary decomposition can be used to estimate the expectation value of an observable with respect to A∣ψ⟩A\lvert\psi\rangle which can be done with Hadamard tests. Since the TUD method can be used to implement non-unitary operators as only two unitaries, it also has potential applications in linear algebra and quantum machine learning [61, 62, 63].

Open Quantum Systems and Kraus Operators

The evolution of an isolated system in a mixed quantum state is described by the von Neumann equation

ρ˙t=−i[H(t),ρt],(1)\dot{\rho}_t=-i[H(t),\rho_t], \tag*{(1)}

where H(t)H(t) is the system’s Hamiltonian and ρt:=ρ(t)\rho_t:=\rho(t) is the density matrix (in ℏ=1\hbar=1 units). The formal solution to Eq. (1) is a unitary transformation

ρt=Ut(ρ0)=Utρ0Ut†,(2)\rho_t=U_t(\rho_0)=U_t\rho_0U_t^\dagger, \tag*{(2)}

where Ut=Texp⁡(−i∫0tH(t′)dt′)U_t=\mathcal{T}\exp\left(-i\int_0^t H(t')\mathrm{d}t'\right) and T\mathcal{T} is the time-ordering operator, simplifying to Ut=exp⁡(−iHt)U_t=\exp(-iHt) when HH is time-independent.

The system and environment together undergo the unitary evolution of an isolated quantum process. To describe the effective dynamics of the system, we trace out the environmental degrees of freedom obtaining the open quantum evolution. Without loss of generality, one can assume that the system is initially decoupled from its environment such that the entire density matrix is ρ0=ωE⊗ρS\rho_0=\omega_E\otimes\rho_S, where ωE\omega_E, ρS\rho_S are the initial density matrices of the environment and system, respectively. The total evolution Ut=Texp⁡(−i∫0tHTotal(t′)dt′)U_t=\mathcal{T}\exp\left(-i\int_0^t H_{\mathrm{Total}}(t')\mathrm{d}t'\right) is described by a Hamiltonian of the general form HTotal(t)=IE⊗HS(t)+HE(t)⊗IS+HI(t)H_{\mathrm{Total}}(t)=I_E\otimes H_S(t)+H_E(t)\otimes I_S+H_I(t), where HSH_S, HEH_E act only on the system and the environment respectively, while HIH_I is responsible for their interaction. This allows us to describe the effective dynamics of the dd-dimensional system in terms of a dynamical map Λt:B(HS)→B(HS)\Lambda_t:\mathcal{B}(\mathcal{H}_S)\to\mathcal{B}(\mathcal{H}_S) given by

Λt(ρS)=Tr⁡E(UtωE⊗ρSUt†)=∑k=1mAk(t)ρSAk†(t),(3)\Lambda_t(\rho_S)=\operatorname{Tr}_E\left(U_t\omega_E\otimes\rho_S U_t^\dagger\right)=\sum_{k=1}^{m}A_k(t)\rho_S A_k^\dagger(t), \tag*{(3)}

where HS\mathcal{H}_S is the Hilbert space of the system, Tr⁡E\operatorname{Tr}_E is the partial trace over the Hilbert space of the environment, and m≤d2m\le d^2. The dynamical map Λt\Lambda_t is a completely positive trace preserving (CPTP) map which describes physically valid transformation from quantum states to quantum states [9]. Following the partial trace, one obtains a set of Kraus operators Ak∈B(HS)A_k\in\mathcal{B}(\mathcal{H}_S), where B(HS)\mathcal{B}(\mathcal{H}_S) is the space of bounded linear operators. The Kraus operators are in general time-dependent, non-unitary, and also depend on the initial environmental state. For example, if ωE=∣ν⟩⟨ν∣\omega_E=|\nu\rangle\langle\nu|, then Ak(t)≡(⟨k∣⊗IS)Ut(∣ν⟩⊗IS)A_k(t)\equiv(\langle k|\otimes I_S)U_t(|\nu\rangle\otimes I_S), where ∣k⟩|k\rangle is a basis for the Hilbert space of the environment. Furthermore, the Kraus representation of the dynamical map is not unique as the partial trace over the environment is independent of the choice of basis. The Kraus operators themselves lack any special structure apart from the following trace-preservation constraint: ∑kAk(t)†Ak(t)=I\sum_k A_k(t)^\dagger A_k(t)=I for all t≥0t\ge0. For notational clarity we shall suppress any explicit dependence on time or other parameters unless stated otherwise: Ak(t)≡AkA_k(t)\equiv A_k.

Since a quantum computer only has access to unitary operations and measurements, the implementation of dynamical maps comprised of non-unitary Kraus operators is a challenge. Implementing the transformation in Eq. (3) by implementing the entire unitary UtU_t that describes the system and its environment together quickly becomes infeasible as the environment can often have large or even infinite dimensionality. Therefore it is necessary to develop quantum algorithms that can emulate the effect of environmental influence indirectly. Given Kraus operators AkA_k block encoded in unitaries UkU_k, we estimate the number of resources to implement each non-unitary Kraus operator individually on a quantum computer as well as the entire map given by Eq. (3). In many practical cases, mm can be assumed to be O(poly⁡log⁡d)O(\operatorname{poly}\log d) and therefore, the implementation of the map becomes practically feasible. For brevity we restrict further analysis to ρS=∣ψ⟩⟨ψ∣\rho_S = |\psi\rangle\langle\psi|, where ∣ψ⟩|\psi\rangle is created by the oracle S\mathcal{S}, with the extension to mixed states being straightforward. Additionally, we analyze the complexity to estimate the expectation value of a Hermitian observable OO,

⟨O⟩=Tr⁡(OΛ(∣ψ⟩⟨ψ∣))=∑k=1m⟨ψ∣Ak†OAk∣ψ⟩,(4)\langle O\rangle= \operatorname{Tr}\left(O\Lambda\left(|\psi\rangle\langle\psi|\right)\right) = \sum_{k=1}^{m}\langle\psi|A_k^\dagger O A_k|\psi\rangle, \tag*{(4)}

such that the estimator is ⟨O⟩^:=1/N∑i=1Nxi\widehat{\langle O\rangle} := 1/N\sum_{i=1}^{N}x_i where xix_i is the ithi^{\text{th}} measured (randomly sampled) value of the random variable XX, where E(X)=⟨O⟩\mathbb{E}(X)=\langle O\rangle and NN is the total number of measurements. In practice NN will be selected so that the variance of the estimate (or standard error of the mean) is below a certain pre-chosen threshold Var⁡(⟨O⟩^)=Var⁡(X)/N≤v\operatorname{Var}(\widehat{\langle O\rangle}) = \operatorname{Var}(X)/N \leq v, as discussed in more detail in App. § 9.

Analysis for Previous Methods

Stinespring Dilation

Simulating the dynamical map of Eq. (3) by realizing the entire evolution of the system and its environment together as a unitary is often infeasible. A natural and intuitive first approach is to instead emulate the degrees of freedom of the environment by a set of auxiliary qubits that may be traced out to obtain the desired map. The Stinespring dilation theorem, proposed long before the advent of quantum simulation, offers a way to achieve this ‘mimicking’ of the environmental degrees of freedom.

Theorem 1 (Stinespring Dilation theorem). Let Λ:B(H)→B(H)\Lambda:\mathcal{B}(\mathcal{H}) \to\mathcal{B}(\mathcal{H}) be a quantum CPTP map over a finite dimensional Hilbert space H\mathcal{H}. Then there exists a Hilbert space E\mathcal{E}, a unitary operator UStU_{\mathrm{St}} over the joint Hilbert space E⊗H\mathcal{E}\otimes\mathcal{H}, and a quantum state ω∈B(E)\omega\in\mathcal{B}(\mathcal{E}), such that

Λ(ρ)=Tr⁡E(USt ω⊗ρ USt†),∀ρ∈H,(5)\Lambda(\rho)=\operatorname{Tr}_{\mathcal{E}}\left(U_{\mathrm{St}}\,\omega\otimes\rho\,U_{\mathrm{St}}^\dagger\right),\quad\forall\rho\in\mathcal{H}, \tag*{(5)}

where dim⁡(E)≤dim⁡(H)2\dim(\mathcal{E})\leq\dim(\mathcal{H})^2, and the representation is unique up to a unitary equivalence.

The Kraus operators can be embedded in the first block-column of the Stinespring dilation unitary UStU_{\mathrm{St}} that acts on the system and a set of auxiliary qubits emulating the environment

References

  1. [1]Yuri Manin. Computable and uncomputable. Sovetskoye Radio, Moscow, 128, 1980.
  2. [2]Richard P. Feynman. Simulating physics with computers. Int. j. Theor. phys, 21(6/7), 1982. DOI: 10.1007/BF02650179. URL https://doi.org/10.1007/BF02650179.
  3. [3]Michael A Nielsen and Isaac Chuang. Quantum computation and quantum information, 2002.
  4. [4]Seth Lloyd. Universal quantum simulators. Science, pages 1073–1078, 1996. DOI: 10.1126/science.273.5278.1073. URL https://www.science.org/doi/abs/10.1126/science.273.5278.1073.DOI
  5. [5]John M. Martyn, Zane M. Rossi, Andrew K. Tan, and Isaac L. Chuang. Grand unification of quantum algorithms. PRX Quantum, 2:040203, Dec 2021. DOI: 10.1103/PRXQuantum.2.040203. URL https://link.aps.org/doi/10.1103/PRXQuantum.2.040203.DOI
  6. [6]I. M. Georgescu, S. Ashhab, and Franco Nori. Quantum simulation. Rev. Mod. Phys., 86:153–185, Mar 2014. DOI: 10.1103/RevModPhys.86.153. URL https://link.aps.org/doi/10.1103/RevModPhys.86.153.DOI
  7. [7]Ashley Montanaro. Quantum algorithms: an overview. npj Quantum Information, 2(1):1–8, 2016. DOI: 10.1038/npjqi.2015.23. URL https://www.nature.com/articles/npjqi201523.DOI
  8. [8]John Preskill. Quantum computing 40 years later. arXiv:2106.10522, 2021. URL https://arxiv.org/abs/2106.10522.
  9. [9]Heinz-Peter Breuer, Francesco Petruccione, et al. The theory of open quantum systems. Oxford University Press on Demand, 2002.
  10. [10]Goran Lindblad. On the generators of quantum dynamical semigroups. Communications in Mathematical Physics, 48(2):119–130, 1976. DOI: 10.1007/BF01608499.DOI
  11. [11]Vittorio Gorini, Andrzej Kossakowski, and Ennackal Chandy George Sudarshan. Completely positive dynamical semigroups of n-level systems. Journal of Mathematical Physics, 17(5):821–825, 1976. DOI: 10.1063/1.522979. URL https://aip.scitation.org/doi/10.1063/1.522979.DOI
  12. [12]Laszlo Gyongyosi, Sandor Imre, and Hung Viet Nguyen. A survey on quantum channel capacities. IEEE Communications Surveys & Tutorials, 20(2):1149–1205, 2018. DOI: 10.1109/COMST.2017.2786748.DOI
  13. [13]Filippo Caruso, Vittorio Giovannetti, Cosmo Lupo, and Stefano Mancini. Quantum channels and memory effects. Rev. Mod. Phys., 86:1203–1259, Dec 2014. DOI: 10.1103/RevModPhys.86.1203. URL https://link.aps.org/doi/10.1103/RevModPhys.86.1203.DOI
  14. [14]Lorenza Viola, Emanuel Knill, and Seth Lloyd. Dynamical decoupling of open quantum systems. Phys. Rev. Lett., 82:2417–2421, Mar 1999. DOI: 10.1103/PhysRevLett.82.2417. URL https://link.aps.org/doi/10.1103/PhysRevLett.82.2417.DOI
  15. [15]Dieter Suter and Gonzalo A. Álvarez. Colloquium: Protecting quantum information against environmental noise. Rev. Mod. Phys., 88:041001, Oct 2016. DOI: 10.1103/RevModPhys.88.041001. URL https://link.aps.org/doi/10.1103/RevModPhys.88.041001.DOI
  16. [16]Easwar Magesan, Daniel Puzzouli, Christopher E. Granade, and David G. Cory. Modeling quantum noise for efficient testing of fault-tolerant circuits. Phys. Rev. A, 87:012324, Jan 2013. DOI: 10.1103/PhysRevA.87.012324. URL https://link.aps.org/doi/10.1103/PhysRevA.87.012324.DOI
  17. [17]Paolo Zanardi, Jeffrey Marshall, and Lorenzo Campos Venuti. Dissipative universal lindbladian simulation. Phys. Rev. A, 93:022312, Feb 2016. DOI: 10.1103/PhysRevA.93.022312. URL https://link.aps.org/doi/10.1103/PhysRevA.93.022312.DOI
  18. [18]Marko Žnidarič, Tomaž Prosen, Giuliano Benenti, Giulio Casati, and Davide Rossini. Thermalization and ergodicity in one-dimensional many-body open quantum systems. Phys. Rev. E, 81:051135, May 2010. DOI: 10.1103/PhysRevE.81.051135. URL https://link.aps.org/doi/10.1103/PhysRevE.81.051135.DOI
  19. [19]Michael J Kastoryano and Fernando GSL Brandao. Quantum Gibbs samplers: The commuting case. Communications in Mathematical Physics, 344(3):915–957, 2016. DOI: 10.1007/s00220-016-2641-8.DOI
  20. [20]Iztok Pižorn. One-dimensional Bose-Hubbard model far from equilibrium. Phys. Rev. A, 88:043635, Oct 2013. DOI: 10.1103/PhysRevA.88.043635. URL https://link.aps.org/doi/10.1103/PhysRevA.88.043635.DOI
  21. [21]Tomaž Prosen and Marko Žnidarič. Matrix product simulations of non-equilibrium steady states of quantum spin chains. Journal of Statistical Mechanics: Theory and Experiment, 2009(02):P02035, 2009. DOI: 10.1088/1742-5468/2009/02/p02035. URL https://doi.org/10.1088/1742-5468/2009/02/p02035.
  22. [22]Tomaž Prosen. Open xxz spin chain: Nonequilibrium steady state and a strict bound on ballistic transport. Phys. Rev. Lett., 106:217206, May 2011. DOI: 10.1103/PhysRevLett.106.217206. URL https://link.aps.org/doi/10.1103/PhysRevLett.106.217206.DOI
  23. [23]Giuliano Benenti, Giulio Casati, Tomaž Prosen, Davide Rossini, and Marko Žnidarič. Charge and spin transport in strongly correlated one-dimensional quantum systems driven far from equilibrium. Phys. Rev. B, 80:035110, Jul 2009. DOI: 10.1103/PhysRevB.80.035110. URL https://link.aps.org/doi/10.1103/PhysRevB.80.035110.DOI
  24. [24]Tomaž Prosen and Marko Žnidarič. Diffusive high-temperature transport in the one-dimensional hubbard model. Phys. Rev. B, 86:125118, Sep 2012. DOI: 10.1103/PhysRevB.86.125118. URL https://link.aps.org/doi/10.1103/PhysRevB.86.125118.DOI
  25. [25]Susana F. Huelga and Martin B. Plenio. Vibrations, quanta and biology. Contemporary Physics, 54(4):181–207, 2013. DOI: 10.1080/00405000.2013.829687.DOI
  26. [26]Zixuan Hu, Kade Head-Marsden, David A. Mazziotti, Prineha Narang, and Sabre Kais. A general quantum algorithm for open quantum dynamics demonstrated with the Fenna-Matthews-Olson complex. Quantum, 6:726, May 2022. ISSN 2521-327X. DOI: 10.22331/q-2022-05-30-726. URL https://doi.org/10.22331/q-2022-05-30-726.
  27. [27]Sarah Mostame, Patrick Rebentrost, Alexander Eisfeld, Andrew J Kerman, Dimitris I Tsomokos, and Alán Aspuru-Guzik. Quantum simulator of an open quantum system using superconducting qubits: exciton transport in photosynthetic complexes. New Journal of Physics, 14(10):105013, 2012. DOI: 10.1088/1367-2630/14/10/105013. URL https://doi.org/10.1088/1367-2630/14/10/105013.
  28. [64]10.1103/PhysRevX.6.031023. URL https://journals.aps.org/prx/abstract/10.1103/PhysRevX.6.031023.
  29. [65]Trevor McCourt, Charles Neill, Kenny Lee, Chris Quintana, Yu Chen, Julian Kelly, V. N. Smelyanskiy, M. I. Dykman, Alexander Korotkov, Isaac L. Chuang, and A. G. Petukhov. Learning noise via dynamical decoupling of entangled qubits. arXiv:2201.11173, 2022. DOI: 10.48550/ARXIV.2201.11173. URL https://arxiv.org/abs/2201.11173.
  30. [66]Koenraad M. R. Audenaert and S. Scheel. On random unitary channels. New Journal of Physics, 10:023011, 2008. DOI: 10.1088/1367-2630/10/2/023011. URL https://iopscience.iop.org/article/10.1088/1367-2630/10/2/023011.DOI
  31. [67]Robert Alicki and Karl Lendi. Quantum dynamical semigroups and applications, volume 717. Springer, 2007. DOI: 10.1007/3-540-70861-8. URL https://link.springer.com/book/10.1007/3-540-70861-8.DOI
  32. [68]Gilles Brassard and Peter Hoyer. An exact quantum polynomial-time algorithm for simon’s problem. In Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pages 12–23. IEEE, 1997.DOI
  33. [69]Gilles Brassard, Peter Hoyer, Michele Mosca, and Alain Tapp. Quantum amplitude amplification and estimation. Contemporary Mathematics, 305:53–74, 2002.DOI
  34. [70]Eliahu Levy and Orr Moshe Shalit. Dilation theory in finite dimensions: the possible, the impossible and the unknown. Rocky Mountain Journal of Mathematics, 44(1):203–221, 2014.arxiv.org/abs/1012.4514
  35. [71]Béla Sz Nagy, Ciprian Foias, Hari Bercovici, and László Kérchy. Harmonic analysis of operators on Hilbert space. Springer Science & Business Media, 2010.
  36. [72]Robin Kothari. Efficient algorithms in quantum query complexity. PhD thesis, University of Waterloo, August 2014. URL http://hdl.handle.net/10012/8625.
  37. [73]Jing Xin Cui, Tao Zhou, and Gui Lu Long. An optimal expression of a kraus operator as a linear combination of unitary matrices. Journal of Physics A: Mathematical and Theoretical, 45(44):444011, 2012. DOI: 10.1088/1751-8113/45/44/444011. URL https://iopscience.iop.org/article/10.1088/1751-8113/45/44/444011.
  38. [74]Pei Wu. Additive combinations of special operators. Banach Center Publications, 30 (1):337–361, 1994. URL http://eudml.org/doc/262750.DOI
  39. [75]Jeongwan Haah. Product decomposition of periodic functions in quantum signal processing. Quantum, 3:190, 2019. DOI: 10.22331/q-2019-10-07-190. URL https://quantum-journal.org/papers/q-2019-10-07-190/.DOI
  40. [76]Rui Chao, Dawei Ding, Andras Gilyén, Cupjin Huang, and Mario Szegedy. Finding angles for quantum signal processing with machine precision. arXiv preprint arXiv:2003.02831, 2020. URL https://arxiv.org/abs/2003.02831.
  41. [77]Yulong Dong, Xiang Meng, K. Birgitta Whaley, and Lin Lin. Efficient phase-factor evaluation in quantum signal processing. Phys. Rev. A, 103:042419, Apr 2021. DOI: 10.1103/PhysRevA.103.042419. URL https://link.aps.org/doi/10.1103/PhysRevA.103.042419.DOI
  42. [78]John M. Martyn, Zane M. Rossi, Andrew K. Tan, and Isaac L. Chuang. Quantum signal processing. https://github.com/ichuang/pyqsp.
  43. [79]J.R. Johansson, P. D. Nation, and F. Nori. Qutip 2: A python framework for the dynamics of open quantum systems. Comp. Phys. Comm., 184(1234), 2013. DOI: 10.1016/j.cpc.2012.11.019.DOI
  44. [80]Yu Tong, Dong An, Nathan Wiebe, and Lin Lin. Fast inversion, preconditioned quantum linear system solvers, fast green’s-function computation, and fast evaluation of matrix functions. Physical Review A, 104(3):03422, 2021. DOI: 10.1103/PhysRevA.104.032422. URL https://journals.aps.org/pra/abstract/10.1103/PhysRevA.104.032422.DOI
  45. [81]Guang Hao Low, Theodore J. Yoder, and Isaac L. Chuang. Methodology of resonant equiangular composite quantum gates. Physical Review X, 6(4), Dec 2016. ISSN 2160-3308. DOI: 10.1103/physrevx.6.041067. URL http://dx.doi.org/10.1103/PhysRevX.6.041067.
  46. [82]Guang Hao Low and Isaac L. Chuang. Hamiltonian simulation by uniform spectral amplification. arXiv preprint arXiv:1707.05391, 2017. URL https://arxiv.org/abs/1707.05391.
  47. [83]Sathyawageeswar Subramanian, Stephen Brierley, and Richard Jozsa. Implementing smooth functions of a hermitian matrix on a quantum computer. Journal of Physics Communications, 3(6):065002, 2019. DOI: 10.1088/2399-6528/ab25a2. URL https://iopscience.iop.org/article/10.1088/2399-6528/ab25a2.DOI

Paper details

vlnc:W_2rjw6wb2
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents