Pseudorandom quantum states (PRSs) and pseudorandom unitaries (PRUs) possess the dual nature of being efficiently constructible while appearing completely random to any efficient quantum algorithm. In this study, we establish fundamental bounds on pseudorandomness. We show that PRSs and PRUs exist only when the probability that an error occurs is negligible, ruling out their generation on noisy intermediate-scale

Bell tests have become a powerful tool for quantifying security, randomness, entanglement, and many other properties, as well as for investigating fundamental physical limits. In all these cases, the specific experimental value of the Bell parameter is important as it leads to a quantitative conclusion. However, experimental implementations can also produce experimental data with (apparent) signaling

In the realm of computational science and engineering, constructing models that reflect real-world phenomena requires solving partial differential equations (PDEs) with different conditions. Recent advancements in neural operators, such as deep operator network (DeepONet), which learn mappings between infinite-dimensional function spaces, promise efficient computation of PDE solutions for a new condition

We adopt a method of the quantum gate teleportation for converting circuit-based quantum computation primitives into fusion networks. By using the presented scheme for the CNOT gate we construct translation of the circuit for the foliated surface code into a fault tolerant fusion network. Finally, we construct two new fusion based quantum computation models and study their fault tolerance properties

Tomographic reconstruction of quantum states plays a fundamental role in benchmarking quantum systems and accessing information encoded in quantum-mechanical systems. Among the informationally complete sets of quantum measurements, the tight ones provide a linear reconstruction formula and minimize the propagation of statistical errors. However, implementing tight measurements in the lab is challenging

The quantum state preparation of probability distributions is an important subroutine for many quantum algorithms. When embedding $D$-dimensional multivariate probability distributions by discretizing each dimension into $2^n$ points, we need a state preparation circuit comprising a total of $nD$ qubits, which is often difficult to compile. In this study, we propose a scalable method to generate state

We study a coarse-graining procedure for quantum cellular automata on hypercubic lattices that consists in grouping neighboring cells into tiles and selecting a subspace within each tile. This is done in such a way that multiple evolution steps applied to this subspace can be viewed as a single evolution step of a new quantum cellular automaton, whose cells are the subspaces themselves. We derive a

In some physical implementations of quantum computers, 2-qubit operations can be applied only on certain pairs of qubits. Compilation of a quantum circuit into one compliant to such qubit connectivity constraint results in an increase of circuit depth. Various compilation algorithms were studied, yet what this depth overhead is remains elusive. In this paper, we fully characterize the depth overhead

We propose a novel Reinforcement Learning (RL) method for optimizing quantum circuits using graph-theoretic simplification rules of ZX-diagrams. The agent, trained using the Proximal Policy Optimization (PPO) algorithm, employs Graph Neural Networks to approximate the policy and value functions. We demonstrate the capacity of our approach by comparing it against the best performing ZX-Calculus-based

We argue that there exists an operational way to establish the observability of the notions of space and time. Specifically, we propose a theory-independent protocol for a gedanken-experiment, whose outcome is a signal establishing the observability of the spacetime manifold, without a priori assuming its existence. The experimental signal contains the information about the dimension and the topology

The transfer and storage of quantum information in a hybrid quantum system, consisting of an ensemble of atoms or spins interacting with a cavity, is adversely affected by the inhomogeneity of the spins, which negates the coherent exchange of excitations between the physical components. Using a full quantum treatment based on variational renormalization group, we show how quantum information encoded

Identification of possible transformations of quantum objects including quantum states and quantum operations is indispensable in developing quantum algorithms. Universal transformations, defined as input-independent transformations, appear in various quantum applications. Such is the case for universal transformations of unitary operations. However, extending these transformations to non-unitary operations

The goal in quantum state transfer is to avoid the need to physically transport carriers of quantum information. This is achieved by using a suitably engineered Hamiltonian that induces the transfer of the state of one subsystem to another. A less known generalization of state transfer considers multiple systems such that any pair can exchange quantum information and transfers can take place at any

We introduce conditionally clean ancilla qubits, a new quantum resource, recently explored by [17], that bridges the gap between traditional clean and dirty ancillae. Like dirty ancillae, they begin and end in an unknown state and can be borrowed from existing system qubits, avoiding the space overhead of explicit qubit allocation. Like clean ancillae, they can be treated as initialized in a known

Simulating the Hubbard model is of great interest to a wide range of applications within condensed matter physics, however its solution on classical computers remains challenging in dimensions larger than one. The relative simplicity of this model, embodied by the sparseness of the Hamiltonian matrix, allows for its efficient implementation on quantum computers, and for its approximate solution using

Masanes, Galley and Müller [39] argue that the measurement postulates of non-relativistic quantum mechanics follow from the structural postulates together with an assumption they call the "possibility of state estimation". Their argument also relies on what they term a "theory-independent characterization of measurements for single and multipartite systems". We refute their conclusion, giving explicit

Quantum machine learning (QML) has become a promising area for real world applications of quantum computers, but near-term methods and their scalability are still important research topics. In this context, we analyze the trainability and controllability of specific Hamming weight preserving variational quantum circuits (VQCs). These circuits use qubit gates that preserve subspaces of the Hilbert space

Spontaneous symmetry breaking in systems with symmetry is a cornerstone phenomenon accompanying second-order phase transitions. Here, we predict the opposite phenomenon, namely, spontaneous symmetry emergence in a system that lacks symmetry. In the example of two coupled oscillators interacting non-symmetrically with a set of oscillators whose frequencies uniformly fill a finite frequency range, we

Block Encoding (BE) is a crucial subroutine in many modern quantum algorithms, including those with near-optimal scaling for simulating quantum many-body systems, which often rely on Quantum Signal Processing (QSP). Currently, the primary methods for constructing BEs are the Linear Combination of Unitaries (LCU) and the sparse oracle approach. In this work, we demonstrate that QSP-based techniques

Quantum detailed balance is formulated in terms of elementary transitions, in close analogy to detailed balance in a classical Markov chain on a finite set of points. An elementary transition is taken to be a pure state of two copies of the quantum system, as a quantum analogue of an ordered pair of classical points representing a classical transition from the first to the second point. This form of

Losses are one of the main bottlenecks for the distribution of entanglement in quantum networks, which can be overcome by the implementation of quantum repeaters. The most basic form of a quantum repeater chain is the swap ASAP repeater chain. In such a repeater chain, elementary links are probabilistically generated and deterministically swapped as soon as two adjacent links have been generated. As

Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending this to a nonlinear problem has proven challenging, with exponential lower bounds having been demonstrated for the time scaling. We provide a quantum algorithm matching

Time evolution in several classes of quantum devices is generated through the application of quantum gates. Resetting is a critical technological feature in these systems allowing for mid-circuit measurement and complete or partial qubit reset. The possibility of realizing discrete-time reset dynamics on quantum computers makes it important to investigate the steady-state properties of such dynamics

We describe a class of spin chains with new physical and computational properties. On the physical side, the spin chains give examples of symmetry-protected topological phases that are defined by non-onsite symmetries, i.e., symmetries that are not a tensor product of single-site operators. These phases can be detected by string-order parameters, but notably do not exhibit entanglement spectrum degeneracy

In this work, we initiate the study of learning quantum processes from quantum statistical queries. We focus on two fundamental learning tasks in this new access model: shadow tomography of quantum processes and process tomography with respect to diamond distance. For the former, we present an efficient average-case algorithm along with a nearly matching lower bound with respect to the number of observables

Understanding how external driving and dissipation jointly influence the dynamics of open quantum systems is essential for advancing the study of non-equilibrium quantum phenomena and developing quantum technologies. The present study addresses the issue by exploring the behavior of open systems in driven optical setups coupled to a bosonic field. Starting from an exact non-Markovian master equation

Recently, Apers and Piddock [TQC '23] strengthened the connection between quantum walks and electrical networks via Kirchhoff's Law and Ohm's Law. In this work, we develop a new multidimensional electrical network by defining Alternative Kirchhoff's Law and Alternative Ohm's Law based on the multidimensional quantum walk framework by Jeffery and Zur [STOC '23]. In analogy to the connection between

We propose in this work a practical approach to address the longstanding and challenging problem of quantum separability, leveraging the correlation matrices of generic observables. General separability conditions are obtained by dint of constructing the measurement-induced Bloch space, which in essence come from the intrinsic constraints in the space of quantum state. The novel approach can not only

We study what can or cannot be certified in communication scenarios where the assumption of independence and identical distribution (iid) between experimental rounds fails. In this respect, we prove that membership tests for non-convex sets of correlations cannot be formulated in the non-iid regime. Similarly, it is impossible to self-test non-extreme quantum operations, such as mixed states, or noisy

Quantum networks are of high interest nowadays and a quantum internet has been long envisioned. Network-entanglement adapts the notion of entanglement to the network scenario and network-entangled states are considered to be a resource to overcome the limitations of a given network structure. In this work, we introduce measures of quantum network-entanglement that are well-defined within the general

Recent developments in domains such as non-local games, quantum interactive proofs, and quantum generative adversarial networks have renewed interest in quantum game theory and, specifically, quantum zero-sum games. Central to classical game theory is the efficient algorithmic computation of Nash equilibria, which represent optimal strategies for both players. In 2008, Jain and Watrous proposed the

In this work, we introduce a method to construct fault-tolerant $\textit{measurement-based quantum computation}$ (MBQC) architectures and numerically estimate their performance over various types of networks. A possible application of such a paradigm is distributed quantum computation, where separate computing nodes work together on a fault-tolerant computation through entanglement. We gauge error

Current noisy quantum computers have multiple types of errors, which can occur in the state preparation, measurement/readout, and gate operation, as well as intrinsic decoherence and relaxation. Partly motivated by the booming of intermediate-scale quantum processors, measurement and gate errors have been recently extensively studied, and several methods of mitigating them have been proposed and formulated

We study the estimation of relative entropy $D(\rho\|\sigma)$ when $\sigma$ is known. We show that the Cramér-Rao type bound equals the relative varentropy. Our estimator attains the Cramér-Rao type bound when the dimension $d$ is fixed. It also achieves the sample complexity $O(d^2)$ when the dimension $d$ increases. This sample complexity is optimal when $\sigma$ is the completely mixed state. Also

We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given Krylov subspace requires the same quantum resources in both the single step and sequential cases. We propose a variance-based criterion for determining a good iterative

Error mitigation will play an important role in practical applications of near-term noisy quantum computers. Current error mitigation methods typically concentrate on correction quality at the expense of frugality (as measured by the number of additional calls to quantum hardware). To fill the need for highly accurate, yet inexpensive techniques, we introduce an error mitigation scheme that builds

Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories. However, if physical gates are subject to geometric-locality constraints, it becomes challenging to realize these codes. In this paper, we construct a new family of $[[N,K,D]]$ codes, referred to as hierarchical codes, that encode a number of logical qubits $K =

Non-Hermitian dynamics in quantum systems preserves the rank of the state density operator. Using this insight, we develop a geometric framework to describe its time evolution. In particular, we identify mutually orthogonal coherent and incoherent directions and provide their physical interpretation. This understanding enables us to optimize the success rate of non-Hermitian driving along prescribed

For random quantum circuits on $n$ qubits of depth $\Theta(\log n)$ with depolarizing noise, the task of sampling from the output state can be efficiently performed classically using a Pauli path method [1] . This paper aims to study the performance of this method beyond random circuits. We first consider the classical simulation of local observables in circuits composed of Clifford and T gates $\unicode{x2013}$

Building on the insight that engineered noise, specifically, engineered dephasing can enhance the adiabaticity of controlled quantum dynamics, we investigate how a dephasing-generating coupling to an auxiliary quantum system affects quantum annealing protocols. By calculating the exact reduced system dynamics, we show how this coupling enhances the system's adiabaticity solely through a coherent mechanism

We present an error mitigation strategy composed of Echo Verification (EV) and Clifford Data Regression (CDR), the combination of which allows one to learn the effect of the quantum noise channel to extract error mitigated estimates for the expectation value of Pauli observables. We analyse the behaviour of the method under the depolarizing channel and derive an estimator for the depolarization rate

Motivated by the expectation that relativistic symmetries might acquire quantum features in Quantum Gravity, we take the first steps towards a theory of ''Doubly'' Quantum Mechanics, a modification of Quantum Mechanics in which the geometrical configurations of physical systems, measurement apparata, and reference frame transformations are themselves quantized and described by ''geometry'' states in

One significant advantage of superconducting processors is their extensive design flexibility, which encompasses various types of qubits and interactions. Given the large number of tunable parameters of a processor, the ability to perform gradient optimization would be highly beneficial. Efficient backpropagation for gradient computation requires a tightly integrated software library, for which no

While in relativity theory space evolves over time into a single entity known as spacetime, quantum theory lacks a standard notion of how to encapsulate the dynamical evolution of a quantum state into a single "state over time". Recently it was emphasized in the work of Fitzsimons, Jones and Vedral that if such a state over time is to encode not only spatial but also temporal correlations which exist

This paper introduces the foliage partition, an easy-to-compute LC-invariant for graph states, of computational complexity $\mathcal{O}(n^3)$ in the number of qubits. Inspired by the foliage of a graph, our invariant has a natural graphical representation in terms of leaves, axils, and twins. It captures both, the connection structure of a graph and the $2$-body marginal properties of the associated

While the notion of quantum chaos is tied to random matrix spectral correlations, also eigenstate properties in chaotic systems are often assumed to be described by random matrix theory. Analytic insights into eigenstate correlations can be obtained by the recently introduced partial spectral form factor. Here, we study the partial spectral form factor in chaotic dual-unitary quantum circuits in the

In this paper, we introduce a numerical framework designed to solve problems within the emerging field of Waveguide Quantum Electrodynamics (WQED). The framework is based on collision quantum optics, where a localized quantum system interacts sequentially with individual time-bin modes. This approach provides a physically intuitive model that allows researchers familiar with tools such as QuTiP in

The use of higher-dimensional photonic encodings (qudits) instead of two-dimensional encodings (qubits) can improve the loss tolerance and reduce the computational resources of photonic-based quantum information processing. To harness this potential, efficient schemes for entangling operations such as the high-dimensional generalization of a linear optics Bell measurement will be required. We show

Extended non-local games are a generalization of monogamy-of-entanglement games, played by two quantum parties and a quantum referee that performs a measurement on their local quantum system. Along the lines of the NPA hierarchy, the optimal winning probability of those games can be upper bounded by a hierarchy of semidefinite programs (SDPs) converging to the optimal value. Here, we show that if one

We propose an interferometric scheme where each photon returns one bit of the binary expansion of an unknown phase. It sets up a method for estimating the phase value at arbitrary uncertainty. This strategy is global, since it requires no prior information, and it achieves the Heisenberg bound independently of the output statistics. We provide simulations and a characterization of this architecture

We introduce an optimal strategy to sample quantum outcomes of local measurement strings for isometric tensor network states. Our method generates samples based on an exact cumulative bounding function, without prior knowledge, in the minimal amount of tensor network contractions. The algorithm avoids sample repetition and, thus, is efficient at sampling distribution with exponentially decaying tails

We study the geodesics on the manifold of mixed quantum states for the Bures metric. It is shown that these geodesics correspond to physical non-Markovian evolutions of the system coupled to an ancilla. Furthermore, we argue that geodesics lead to optimal precision in single-parameter estimation in quantum metrology. More precisely, if the unknown parameter $x$ is a phase shift proportional to the

$\mathcal{PT}$-symmetric systems have garnered significant attention due to their unconventional properties. Despite the growing interest, there remains an ongoing debate about whether these systems outperform their Hermitian counterparts in practical applications, and if so, by what metrics this performance should be measured. We developed $\mathcal{PT}$-symmetric approach for mapping $N = 3$ pure

In unitary property testing a quantum algorithm, also known as a tester, is given query access to a black-box unitary and has to decide whether it satisfies some property. We propose a new technique for proving lower bounds on the quantum query complexity of unitary property testing and related problems, which utilises its connection to unitary channel discrimination. The main advantage of this technique

We work out the general theory of one-parameter families of partial entanglement properties and the resulting entanglement depth-like quantities. Special cases of these are the depth of partitionability, the depth of producibility (or simply entanglement depth) and the depth of stretchability, which are based on one-parameter families of partial entanglement properties known earlier. We also construct

Quantum coherence—an indispensable resource for quantum technologies—is known to be distillable from a noisy form using operations that cannot create it. However, distillation exacts a hidden coherent $measurement$ cost, which has not previously been examined. We devise the $\textit{target effect}$ construction to characterize this cost through detailed conditions on the coherence-measuring structure

We introduce the Piquasso quantum programming framework, a full-stack open-source software platform for the simulation and programming of photonic quantum computers. Piquasso can be programmed via a high-level Python programming interface enabling users to perform efficient quantum computing with discrete and continuous variables. Via optional high-performance C++ backends, Piquasso provides state-of-the-art

Understanding the structure of quantum correlations in a many-body system is key to its computational treatment. For fermionic systems, correlations can be defined as deviations from Slater determinant states. The link between fermionic correlations and efficient computational physics methods is actively studied but remains ambiguous. We make progress in establishing this connection mathematically

Local simultaneous state discrimination (LSSD) is a recently introduced problem in quantum information processing. Its classical version is a non-local game played by non-communicating players against a referee. Based on a known probability distribution, the referee generates one input for each of the players and keeps one secret value. The players have to guess the referee's value and win if they

Models of interacting many-body quantum systems that may realize new exotic phases of matter, notably quantum spin liquids, are challenging to study using even state-of-the-art classical methods such as tensor network simulations. Quantum computing provides a promising route for overcoming these difficulties to find ground states, dynamics, and more. In this paper, we argue that recently developed