arXiv subjects

Oskari Kerppo

Publications and source records attributed to Oskari Kerppo.

15 recordsLinked to original sources

arXiv2026

Minimizing entanglement entropy for enhanced quantum state preparation

Quantum state preparation is an important subroutine in many quantum algorithms. The goal is to encode classical information directly to the quantum state so that it is possible to leverage quantum algorithms for data processing. However, quantum state preparation of arbitrary states scales exponentially in the number of two-qubit gates, and this makes quantum state preparation a very difficult task on quantum computers, especially on near-term noisy devices. This represents a major challenge in achieving quantum advantage. We present and analyze a novel two-step state preparation method where we first minimize the entanglement entropy of the target quantum state, thus transforming the state to one that is easier to prepare. The state with reduced entanglement entropy is then represented as a matrix product state, resulting in a high accuracy preparation of the target state. Our method is suitable for NISQ devices and we give rigorous lower bounds on the accuracy of the prepared state in terms of the entanglement entropy. We benchmark our method with 2D normal distribution and Ricker wavelet states with 6--20 qubits.

quant-ph↗

arXiv2026

Quantum algorithm for the lattice Boltzmann method with applications on real quantum devices

We introduce a novel quantum algorithm for the lattice Boltzmann method (LBM) based on the one-step simplified LBM. The structure of the algorithm allows for more flexibility in modelling different physics in contrast to earlier quantum algorithms for the LBM, while retaining computational efficiency in terms of the gate and qubit complexity. The new algorithm has potential for full end-to-end quantum utility especially for linear problems. We discuss the implementation of examples in linear acoustics, as well as a nonlinear Navier-Stokes problem that was solved on an IBM QPU in a hybrid simulation loop.

quant-ph↗

arXiv2025

Random Exclusion Codes: Quantum Advantages of Single-Shot Communication

Useful applications of quantum information technologies can be found by identifying tasks in which quantum resources outperform their classical counterparts. In this work, we introduce a two-party communication primitive, random exclusion code (REC), which is a single-shot prepare-and-measure protocol where a sender encodes a random message into a shorter sequence and a receiver attempts to exclude a randomly chosen letter in the original message. We present quantum advantages in RECs in two ways: probability and dimension. We show that RECs with quantum resources achieve higher success probabilities than classical strategies. We verify that the quantum resources required to describe detection events of RECs have a smaller dimension than classical ones. We also show that a guessing counterpart, random access codes (RACs), may not have a dimension advantage over classical resources. Our results elucidate various possibilities of achieving quantum advantages in two-party communication.

quant-ph↗

arXiv2025

Towards reliable quantum software, algorithm and use-case development: Multidisciplinary analysis from the perspective of Finnish industries

Quantum computing is a disruptive technology with the potential to transform various fields. It has predicted abilities to solve complex computational problems beyond the reach of classical computers. However, developing quantum software faces significant challenges. Quantum hardware is yet limited in size and unstable with errors and noise. A shortage of skilled developers and a lack of standardization delay adoption. Quantum hardware is in the process of maturing and is constantly changing its characteristics rendering algorithm design increasingly complex, requiring innovative solutions. Project "Towards reliable quantum software development: Approaches and use-cases" TORQS has studied the dilemma of reliable software development and potential for quantum computing for Finnish industries from multidisciplinary points of views. Here we condense the main observations and results of the project into an essay roadmap and timeline for investing in quantum software, algorithms, hardware, and business.

quant-ph↗

arXiv2025

Gate teleportation-assisted routing for quantum algorithms

The limited qubit connectivity of quantum processors poses a significant challenge in deploying practical algorithms and logical gates, necessitating efficient qubit mapping and routing strategies. When implementing a gate that requires additional connectivity beyond the native connectivity, the qubit state must be moved to a nearby connected qubit to execute the desired gate locally. This is typically achieved using a series of SWAP gates creating a SWAP path. However, routing methods relying on SWAP gates often lead to increased circuit depth and gate count, motivating the need for alternative approaches. This work explores the potential of teleported gates to improve qubit routing efficiency, focusing on implementation within specific hardware topologies and benchmark quantum algorithms. We propose a routing method that is assisted by gate teleportation. It establishes additional connectivity using gate teleportation paths through available unused qubits, termed auxiliary qubits, within the topology. To optimize this approach, we have developed an algorithm to identify the best gate teleportation connections, considering their potential to reduce the depth of the circuit and address possible errors that may arise from the teleportation paths. Finally, we demonstrate depth reduction with gate teleportation-assisted routing in various benchmark algorithms, including case studies on the compilation of the Deutsch-Jozsa algorithm and the Quantum Approximation Optimization Algorithm (QAOA) for heavy-hexagon topology used in IBM 127-qubit Eagle r3 processors. Our benchmark results show a 10-25 $\%$ depth reduction in the routing of selected algorithms compared to regular routing without using the teleported gate.

quant-ph↗

arXiv2024

Maximal Elements of Quantum Communication

A prepare-and-measure scenario is naturally described by a communication matrix that collects all conditional outcome probabilities of the scenario into a row-stochastic matrix. The set of all possible communication matrices is partially ordered via the possibility to transform one matrix to another by pre- and post-processings. By considering maximal elements in this preorder for a subset of matrices implementable in a given theory, it becomes possible to identify communication matrices of maximum utility, i.e., matrices that are not majorized by any other matrices in the theory. The identity matrix of an appropriate size is the greatest element in classical theories, while the maximal elements in quantum theory have remained unknown. We completely characterize the maximal elements in quantum theory, thereby revealing the essential structure of the set of quantum communication matrices. In particular, we show that the identity matrix is the only maximal element in quantum theory but, as opposed to a classical theory, it is not the greatest element. Quantum theory can hence be seen to be distinct from classical theory by the existence of incompatible communication matrices.

quant-ph↗

arXiv2024

Simple Information Processing Tasks with Unbounded Quantum Advantage

Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of the system. We show that already in the simplest possible scenarios it is possible to detect a definite, unbounded advantage of quantum systems over classical systems. We do this by constructing a family of operationally meaningful communication tasks each of which on one hand can be implemented by using just a single qubit but which on the other hand require unboundedly larger classical system for classical implementation. Furthemore, we show that even though with the additional resource of shared randomness the proposed communication tasks can be implemented by both quantum and classical systems of the same size, the number of coordinated actions needed for the classical implementation also grows unboundedly. In particular, no finite storage can be used to store all the coordinated actions needed to implement all the possible quantum communication tasks with classical systems. As a consequence, shared randomness cannot be viewed as a free resource.

quant-ph↗

arXiv2022

Partial ignorance communication tasks in quantum theory

We introduce a generalization of communication of partial ignorance where both parties of a prepare-and-measure setup receive inputs from a third party before a success metric is maximized over the measurements and preparations. Various methods are used to obtain bounds on the success metrics, including SDPs, ultraweak monotones for communication matrices and frame theory for quantum states. Simplest scenarios in the new generalized prepare-and-measure setting, simply called partial ignorance communication tasks, are analysed exhaustively for bits and qudits. Finally, the new generalized setting allows the introduction of operational equivalences to the preparations and measurements, allowing us to analyse and observe a contextual advantage for quantum theory in one of the communication tasks.

quant-ph↗

arXiv2021

Experimentally accessible non-separability criteria for multipartite entanglement structure detection

The description of the complex separability structure of quantum states in terms of partially ordered sets has been recently put forward. In this work, we address the question of how to efficiently determine these structures for unknown states. We propose an experimentally accessible and scalable iterative methodology that identifies, on solid statistical grounds, sufficient conditions for non-separability with respect to certain partitions. In addition, we propose an algorithm to determine the minimal partitions (those that do not admit further splitting) consistent with the experimental observations. We test our methodology experimentally on a 20-qubit IBM quantum computer by inferring the structure of the 4-qubit Smolin and an 8-qubit W states. In the first case, our results reveal that, while the fidelity of the state is low, it nevertheless exhibits the partitioning structure expected from the theory. In the case of the W state, we obtain very disparate results in different runs on the device, which range from non-separable states to very fragmented minimal partitions with little entanglement in the system. Furthermore, our work demonstrates the applicability of informationally complete POVM measurements for practical purposes on current NISQ devices.

quant-ph↗

arXiv2020

Reheating in the kination epoch via multi-channel decay of gravitationally created massive scalars

We provide a detailed study of reheating in the kination regime in a scenario where the particle content is produced by gravitational production of massive scalars decaying into massless scalars and fermions which eventually reheat the Universe. A detailed calculation is given by using Boltzmann equations and decay rates obtained using formalism of quantum field theory in curved spacetime. By numerical calculations the reheating temperature is found to be in the $10^{9}$-$10^{13}$ GeV regime. Moreover, the fermionic channel of decay is found to be the dominant channel of decay when the mass $m$ of the decaying particle is small raising the reheating temperature as opposed to a single scalar decay channel.

gr-qc↗

arXiv2020

Communication tasks in operational theories

We investigate the question which communication tasks can be accomplished within a given operational theory. The concrete task is to find out which communication matrices have a prepare-and-measure implementation with states and measurement from a given theory. To set a general framework for this question we develop the ultraweak matrix majorization in the set of communication matrices. This preorder gives us means to determine when one communication task is more difficult than another. Furthermore, we introduce several monotones which can be used to compare and characterize the communication matrices. We observe that not only do the monotones allow us to compare communication matrices, but also their maximal values in a given theory are seen to relate to some physical properties of the theory. The maximal values can then be thought as `dimensions', allowing us to compare different theories to each other. We analyse the introduced monotones one by one and demonstrate how the set of implementable communication matrices is different in several theories with the focus being mainly on the difference between classical and quantum theories of a given dimension.

quant-ph↗

arXiv2019

Reheating via gravitational particle production in kination epoch

We provide a detailed study of reheating in the kination regime where particle content is created by gravitational production of massive scalars mutually interacting with a massless scalar field. The produced particles subsequently decay into massless particles eventually reheating the Universe. We aim for a more precise picture using Boltzmann equations and decay rates obtained by methods of quantum field theory in curved spacetime. By numerical calculations it is found that after inflation the Universe ends up being dominated by ordinary matter for a while before the radiation dominated era. The reheating temperature itself is found to be in the $10^6-10^{12}\ \text{GeV}$ regime.

gr-qc↗

arXiv2019

Communication of partial ignorance with qubits

We introduce a class of communication tests where the task is to communicate partial ignorance by means of a physical system. We present a full characterization of the implementations of these tests in the qubit case and partial results for qudits. A peculiar observation is that two physical systems with the same operational dimensions may differ with respect to implementations of these tasks, as is shown to be the case for the qubit and rebit. Finally, we consider the natural question whether some of the communication tests are more difficult than others. A new preordering that we call the ultraweak matrix majorization is presented to answer this question in a theory-independent way.

quant-ph↗

arXiv2018

Entanglement Protection via Periodic Environment Resetting in Continuous Time Quantum Dynamical Processes

The temporal evolution of entanglement between a noisy system and an ancillary system is analyzed in the context of continuous time open quantum system dynamics. Focusing on a couple of analytically solvable models for qubit systems, we study how Markovian and non-Markovian characteristics influence the problem, discussing in particular their associated entanglement-breaking regimes. These performances are compared with those one could achieve when the environment of the system is forced to return to its input configuration via periodic instantaneous resetting procedures.

quant-ph↗

arXiv2018

Antidistinguishability of Pure Quantum States

The Pusey-Barrett-Rudolph theorem has recently provoked a lot of discussion regarding the reality of the quantum state. In this article we focus on a property called antidistinguishability, which is a main component in constructing the proof for the PBR theorem. In particular we study algebraic conditions for a set of pure quantum states to be antidistinguishable, and a novel sufficient condition is presented. We also discuss a more general criterion which can be used to show that the sufficient condition is not necessary. Lastly, we consider how many quantum states needs to be added into a set of pure quantum states in order to make the set antidistinguishable. It is shown that in the case of qubit states the answer is one, while in the general but finite dimensional case the answer is at most $n$, where $n$ is the size of the original set.

quant-ph↗