Tootfinder

IBM plans to build IBM Quantum Starling, a "fault-tolerant" quantum computer with 20,000x the power of today's quantum computers, in New York state by 2029 (Wall Street Journal)
https://www.wsj.com…

Variational quantum algorithms with invariant probabilistic error cancellation on noisy quantum processors
Yulin Chi, Hongyi Shi, Wen Zheng, Haoyang Cai, Yu Zhang, Xinsheng Tan, Shaoxiong Li, Jianwei Wang, Jiangyu Cui, Man-Hong Yung, Yang Yu
https://arxiv.org/abs/2506.07039

Variational quantum algorithms with invariant probabilistic error cancellation on noisy quantum processors
In the noisy intermediate-scale quantum era, emerging classical-quantum hybrid optimization algorithms, such as variational quantum algorithms (VQAs), can leverage the unique characteristics of quantum devices to accelerate computations tailored to specific problems with shallow circuits. However, these algorithms encounter biases and iteration difficulties due to significant noise in quantum processors. These difficulties can only be partially addressed without error correction by optimizing h…

This https://arxiv.org/abs/2505.11862 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLG_…

Q-Policy: Quantum-Enhanced Policy Evaluation for Scalable Reinforcement Learning
We propose Q-Policy, a hybrid quantum-classical reinforcement learning (RL) framework that mathematically accelerates policy evaluation and optimization by exploiting quantum computing primitives. Q-Policy encodes value functions in quantum superposition, enabling simultaneous evaluation of multiple state-action pairs via amplitude encoding and quantum parallelism. We introduce a quantum-enhanced policy iteration algorithm with provable polynomial reductions in sample complexity for the evaluat…

Quantum Checkers: The Development and Analysis of a Quantum Combinatorial Game
Marien Raat, Luuk van den Nouweland, Matthias M\"uller-Brockhausen, Mike Preuss, Evert van Nieuwenburg
https://arxiv.org/abs/2506.05962

Quantum Checkers: The Development and Analysis of a Quantum Combinatorial Game
This paper develops and analyses a novel quantum combinatorial game: quantum checkers (codenamed Cheqqers). The concepts of superposition, entanglement, measurements and interference from quantum mechanics are integrated into the game of checkers by adding new types of legal moves. The addition of these new rules is done gradually by introducing several levels of `quantumness'. Quantum checkers provides a framework for interpolating between a known and solved classical game and a more complex q…

Quantum transduction via generalized continuous-variable teleportation
Quntao Zhuang
https://arxiv.org/abs/2506.06899 https://arxiv.o…

Quantum transduction via generalized continuous-variable teleportation
Quantum transduction converts quantum states between different frequencies. Similarly, quantum teleportation transfers quantum states between different systems. While often appreciated for quantum communication between distant locations, teleportation can also operate between different frequencies. In terms of bosonic modes, quantum teleportation relies on two-mode squeezing -- squeezed on the balanced Einstein-Podolsky-Rosen (EPR) quadratures -- for entanglement and a balanced beamsplitter plu…

Quantum correlations in molecular cavity optomechanics
E. Kongkui Berinyuy, D. R. Kenigoule Massembele, P. Djorwe, R. Altuijri, M. R. Eid, A. -H. Abdel-Aty, S. G. Nana Engo
https://arxiv.org/abs/2506.07277

Quantum correlations in molecular cavity optomechanics
In quantum information, quantum correlations--particularly entanglement, EPR steering, and quantum discord--stand as interesting resources, powering breakthroughs from secure communication and quantum teleportation to efficient quantum computation. Here, we unveil a theoretical framework for generating and controlling these vital quantum phenomena within a double-cavity molecular optomechanical (McOM) system. This innovative approach leverages strong interactions between confined optical fields…

Optimizing entanglement distribution via noisy quantum channels
Piotr Masajada, Marco Fellous-Asiani, Alexander Streltsov
https://arxiv.org/abs/2506.06089 …

Optimizing entanglement distribution via noisy quantum channels
Entanglement distribution is a crucial problem in quantum information science, owing to the essential role that entanglement plays in enabling advanced quantum protocols, including quantum teleportation and quantum cryptography. We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels. Specifically, we compare two configurations: one where the entanglement source is placed at the midpoint of the communication line, and another wh…

Experimental Efficient Influence Sampling of Quantum Processes
Hao Zhan, Zongbo Bao, Zekun Ye, Qianyi Wang, Minghao Mi, Penghui Yao, Lijian Zhang
https://arxiv.org/abs/2506.07103 …

Experimental Efficient Influence Sampling of Quantum Processes
Characterizing quantum processes paves the way for unlocking the full potential of quantum systems. However, quantum process tomography demands intensive resources and becomes infeasible on large-scale quantum devices. Other methods have explored advanced strategies, yet challenges in experimental feasibility and scalability persist. To address this issues, we introduce influence sampling that efficiently extracts the key \textit{influence} of a quantum process on qubit subsets using at most th…

Optimal quantum sampling on distributed databases
Longyun Chen, Jingcheng Liu, Penghui Yao
https://arxiv.org/abs/2506.07724 https://a…

Optimal quantum sampling on distributed databases
Quantum sampling, a fundamental subroutine in numerous quantum algorithms, involves encoding a given probability distribution in the amplitudes of a pure state. Given the hefty cost of large-scale quantum storage, we initiate the study of quantum sampling in a distributed setting. Specifically, we assume that the data is distributed among multiple machines, and each machine solely maintains a basic oracle that counts the multiplicity of individual elements. Given a quantum sampling task, which …

Simulating discrete-time quantum walk with urn model
Surajit Saha
https://arxiv.org/abs/2506.06896 https://arxiv.org/pdf/2506.06896…

Simulating discrete-time quantum walk with urn model
Urn models have long been used to study stochastic processes, probability distributions, and reinforcement dynamics. Meanwhile, discrete time quantum walks (DTQW) serve as fundamental components in quantum computation and quantum information theory. This work explores a novel connection between an urn model and discrete-time quantum walks, focusing on how urn-based stochastic processes can provide insights into quantum state evolution and algorithmic behavior. Importantly, our model operates en…