q-2023-09-15-1115.pdf
…local entanglement in addition to the non-local one associ- ated with the global superposition. While the local entanglement can be directly removed by the cooling algorithm, the global one is…
…local entanglement in addition to the non-local one associ- ated with the global superposition. While the local entanglement can be directly removed by the cooling algorithm, the global one is…
J. Odavić, G. Torre, N. Mijić, D. Davidović, F. Franchini, and S. M. Giampaolo,
E. R. Castro, Jorge Chávez-Carlos, I. Roditi, Lea F. Santos, and Jorge G. Hirsch,
Martin Larocca, Piotr Czarnik, Kunal Sharma, Gopikrishnan Muraleedharan, Patrick J. Coles, and M. Cerezo,
Emiel Koridon, Joana Fraxanet, Alexandre Dauphin, Lucas Visscher, Thomas E. O’Brien, and Stefano Polla,
…costs are only incurred when j is a principal row of A, the time complexity is O(sj) when j is not a principal row of A. 4.3 Diagonal Clifford operations…
…it significantly degrades the error-correction performance of classical message-passing decoders. To improve their performance, a post-processing algorithm is usually employed. To narrow the gap be- tween algorithmic solutions and hardware…
José D. Guimarães, Mikhail I. Vasilevskiy, and Luís S. Barbosa,
…Agrawal, S. Halder, and M. Banik, “Genuinely entangled subspace with all-encompassing distill- able entanglement across every bipartition,” Phys. Rev. A, vol. 99, p. 032335, 2019. [Online]. Avail- able: https://link.aps.org/doi/10.1103/PhysRevA. 99.032335…
…T additional qubits with qexp given by Eq. (71). All in all, the total T-depth for path loading using the re-parameterization method to precision ε for d assets and T…
Shouvanik Chakrabarti, Rajiv Krishnakumar, Guglielmo Mazzola, Nikitas Stamatopoulos, Stefan Woerner, and William J. Zeng,
Ryan Shaffer, Hang Ren, Emiliia Dyrenkova, Christopher G. Yale, Daniel S. Lobser, Ashlyn D. Burch, Matthew N. H. Chow, Melissa C. Revelle, Susan M. Clark, and Hartmut Häffner,
…remain small enough to be tractable via classical algorithms, such as the Broyden–Fletcher–Goldfarb–Shanno (BFGS) optimization algorithm[41] used in our im- plementation. Also, since the performance of the out- lined algorithm…
Francesco Massa, Preeti Yadav, Amir Moqanaki, Walter O. Krawec, Paulo Mateus, Nikola Paunković, André Souto, and Philip Walther,
…it is the natural procedure in se- quential analysis algorithms [32, 33]. When trying to discriminate between two states, it is known that online strategies at- tain optimal global performance,…