On Quantum Methods for Machine Learning Problems Part I: Quantum Tools by Farid Ablayev, Marat Ablayev, Joshua Zhexue Huang, Kamil Khadiev, Nailya Salikhova, Dingming Wu

“…The first part, "quantum tools", presents the fundamentals of qubits, quantum registers, and quantum states, introduces important quantum tools based on known quantum search algorithms and SWAP-test, and discusses the basic quantum procedures used for quantum search methods. …”
Get full text

Simulation of Nonradiative Energy Transfer in Photosynthetic Systems Using a Quantum Computer by José Diogo Guimarães, Carlos Tavares, Luís Soares Barbosa, Mikhail I. Vasilevskiy

“…We performed quantum simulations of such phenomena, for a proof of concept scenario, in an actual quantum computer, IBM Q, of 5 qubits. We validate the results with the Haken-Ströbl model and discuss the influence of environmental parameters on the efficiency of the energy transport.…”
Get full text

Noise-tolerant Grover's algorithm via success-probability prediction by Jian Leng, Fan Yang, Xiang-Bin Wang

“…We propose a noise-tolerant method that significantly reduces the running time and exponentially improves the error threshold with number of qubits for Grover's search. Experiments are implemented on different quantum computing setups, with all results clearly confirming the advantage of our noise-tolerant method to the original Grover's search. …”
Get full text

Efficient quantum signature protocol of classical messages by WANG Jian, ZHANG Quan, TANG Chao-jing

“…An efficient quantum signature protocol of classical messages which was based on quantum one-time pad and quantum key distribution was presented.The classical messages of any length could be encoded into the quantum infor-mation of determinate length because hash function was used to generate message digests.Especially for a large number of messages,the length of shared keys and the number of qubits were greatly shortened in the present protocol.Moreover,it was unnecessary for the protocol to use entangled states and only von Neumann measurement was needed.Compared with other quantum signature protocols,the efficiency of the present quantum signature protocol was greatly improved.…”
Get full text

Pulse engineering via projection of response functions by Nicolas Heimann, Lukas Broers, Ludwig Mathey

“…We demonstrate this approach, and compare it to the standard GRAPE algorithm, for the example of a quantum gate on two qubits, demonstrating a clear improvement in convergence and optimal fidelity of the generated protocol.…”
Get full text

Hamiltonian simulation of minimal holographic sparsified SYK model by Raghav G. Jha

“…This complexity implies that with less than a hundred logical qubits and about 106 gates, it might be possible to achieve an advantage in this model and simulate real-time dynamics.…”
Get full text

Multiplexed Quantum Communication with Surface and Hypergraph Product Codes by Shin Nishio, Nicholas Connolly, Nicolò Lo Piparo, William John Munro, Thomas Rowan Scruby, Kae Nemoto

“…We show that, although multiplexing makes loss errors more damaging, assigning qubits to photons in an intelligent manner can minimize these effects, and the ability to encode higher-distance codes in a smaller number of photons can result in overall lower logical error rates. …”
Get full text

Refining resource estimation for the quantum computation of vibrational molecular spectra through Trotter error analysis by Dimitar Trenev, Pauline J Ollitrault, Stuart M. Harwood, Tanvi P. Gujarati, Sumathy Raman, Antonio Mezzacapo, Sarah Mostame

“…In this work we accurately estimate quantum resources, such as number of logical qubits and quantum gates, required for vibrational structure calculations on a programmable quantum computer. …”
Get full text

Streaming quantum state purification by Andrew M. Childs, Honghao Fu, Debbie Leung, Zhi Li, Maris Ozols, Vedang Vyas

“…This basic task has applications to quantum communication over noisy channels and quantum computation with imperfect devices, but has only been studied previously for the case of qubits. We derive an efficient purification procedure based on the swap test for qudits of any dimension, starting with any initial error parameter. …”
Get full text

Tweezer-Assisted Subwavelength Positioning of Atomic Arrays in an Optical Cavity by M. Seubert, L. Hartung, S. Welte, G. Rempe, E. Distante

“…The atoms are subsequently transferred from the tweezer array to a two-dimensional intracavity optical lattice that offers enhanced coherence for spin qubits while maintaining strong atom confinement. …”
Get full text

Simulating quantum circuits using the multi-scale entanglement renormalization ansatz by A. V. Berezutskii, I. A. Luchnikov, A. K. Fedorov

“…We benchmark the proposed technique for brick-wall quantum circuits of up to 243 qubits with various depths up to 20 layers. Our approach paves a way to exploring efficient simulation techniques for quantum many-body systems.…”
Get full text

Realization of a spin-1/2 Kondo necklace model with magnetic field-induced coupling switch by Hironori Yamaguchi, Yu Tominaga, Takanori Kida, Koji Araki, Takashi Kawakami, Yoshiki Iwasaki, Kenta Kimura, Masayuki Hagiwara

“…This offers other opportunities for quantum technologies, particularly in the development of tunable qubits for quantum computing and spintronic devices, where precise control over spin interactions is essential.…”
Get full text

Probing entanglement dynamics and topological transitions on noisy intermediate-scale quantum computers by Huai-Chun Chang, Hsiu-Chuan Hsu, Yu-Cheng Lin

“…The twist order parameter and the Berry phase are measured without the need for additional gates or ancilla qubits. We consider quench protocols in which a trivial initial state evolves dynamically in time under the topological SSH Hamiltonian in the fully dimerized limit (the flat-band limit). …”
Get full text

Recursive Quantum Relaxation for Combinatorial Optimization Problems by Ruho Kondo, Yuki Sato, Rudy Raymond, Naoki Yamamoto

“…Combining this finding with the concept of quantum random access codes (QRACs) for encoding bits into quantum states on fewer qubits, we propose an efficient recursive quantum relaxation method called recursive quantum random access optimization (RQRAO) for MAX-CUT. …”
Get full text

Integrability of open boundary driven quantum circuits by Chiara Paletta, Tomaž Prosen

“…In this paper, we address the problem of Yang-Baxter integrability of doubled quantum circuit of qubits (spins 1/2) with open boundary conditions where the two circuit replicas are only coupled at the left or right boundary. …”
Get full text

Noisy Approach to Intrinsically Mixed-State Topological Order by Ramanjit Sohal, Abhinav Prem

“…Through a series of examples, we show that the decohered state can display a classical memory, encode logical qubits (i.e., exhibit a quantum memory), and even host chiral or nonmodular topological order. …”
Get full text

Optical driving, spin initialization and readout of single SiV− centers in a Fabry-Perot resonator by Gregor Bayer, Robert Berghaus, Selene Sachero, Andrea B. Filipovski, Lukas Antoniuk, Niklas Lettner, Richard Waltrich, Marco Klotz, Patrick Maier, Viatcheslav Agafonov, Alexander Kubanek

“…Ideal quantum repeater nodes efficiently link a quantum memory with photons serving as flying qubits. Color centers in diamond, particularly the negatively charged silicon vacancy center, are promising candidates to establish such nodes. …”
Get full text

Probing quantum floating phases in Rydberg atom arrays by Jin Zhang, Sergio H. Cantú, Fangli Liu, Alexei Bylinskii, Boris Braverman, Florian Huber, Jesse Amato-Grill, Alexander Lukin, Nathan Gemelke, Alexander Keesling, Sheng-Tao Wang, Yannick Meurice, Shan-Wen Tsai

“…In this study, we investigate the different quantum phases that arise in ladder arrays comprising up to 92 neutral-atom qubits and experimentally observe the emergence of the quantum floating phase. …”
Get full text

Low-Rank Variational Quantum Algorithm for the Dynamics of Open Quantum Systems by Sara Santos, Xinyu Song, Vincenzo Savona

“…The algorithm encodes each pure state of the statistical mixture as a parametrized quantum circuit, and the associated probabilities as additional variational parameters stored classically, thereby requiring a significantly lower number of qubits than algorithms where the full density matrix is encoded in the quantum memory. …”
Get full text

Two-Party Quantum Private Comparison Protocol for Direct Secret Comparison by Min Hou, Yue Wu

“…In this paper, we leverage the properties of the swap test to evaluate the similarity of two qubits and propose a two-party quantum private comparison (QPC) protocol involving a semi-trusted third party (TP). …”
Get full text