Quantum Physics (quant-ph)

Abstract: Uncertainty principle prohibits the precise measurement of both components of displacement parameters in phase space. We have theoretically shown that this limit can be beaten using single-photon states, in a single-shot and single-mode setting [F. Hanamura et al., Phys. Rev. A 104, 062601 (2021)]. In this paper, we validate this by experimentally beating the classical limit. In optics, this is the first experiment to estimate both parameters of displacement using non-Gaussian states. This result is related to many important applications, such as quantum error correction.

Abstract: Quantum networks will be able to service consumers with long distance entanglement by use of repeater nodes that can both generate external Bell pairs with their neighbors, iid with probability $p$, as well as perform internal Bell State Measurements (BSMs) which succeed with some probability $q$. The actual values of these probabilities is dependent upon the experimental parameters of the network in question. While global link state knowledge is needed to maximize the rate of entanglement generation between any two consumers, this may be an unreasonable request due to the dynamic nature of the network. This work evaluates a local link state knowledge, multi-path routing protocol that works with time multiplexed repeaters that are able to perform BSMs across different time steps. This study shows that the average rate increases with the time multiplexing block length, $k$, although the initial latency also increases. When a step function memory decoherence model is introduced so that qubits are held in the quantum memory for a time exponentially distributed with mean $\mu$, an optimal $k$ ($k_\text{opt}$) value appears. As $p$ decreases or $\mu$ increases the value of $k_\text{opt}$ increases. This value is such that the benefits from time multiplexing are balanced with the increased risk of losing a previously established entangled pair.

Abstract: In the conventional Schr\"{o}dinger's formulation of quantum mechanics the unitary evolution of a state $\psi$ is controlled, in Hilbert space ${\cal L}$, by a Hamiltonian $\mathfrak{h}$ which must be self-adjoint. In the recent, ``quasi-Hermitian'' reformulation of the theory one replaces $\mathfrak{h}$ by its isospectral but non-Hermitian avatar $H = \Omega^{-1}\mathfrak{h}\Omega$ with $\Omega^\dagger\Omega = \Theta \neq I$. Although acting in another, manifestly unphysical Hilbert space ${\cal H}$, the amended Hamiltonian $H \neq H^\dagger$ can be perceived as self-adjoint with respect to the amended inner-product metric $\Theta$. In our paper motivated by a generic technical ``user-unfriendliness'' of the non-Hermiticity of $H$ we introduce and describe a specific new family of Hamiltonians $H$ for which the metrics $\Theta$ become available in closed form.

Abstract: We propose a procedure to extract vacuum expectation values from approximate vacuum prepared by the adiabatic quantum computation. We use plural ancilla bits with hierarchical structure, intending to gradually put up approximate precision. We exhibit simulation results for a typical one-qubit system and a two-qubits system based on the (1+1)-dimensional Schwinger model using classically emulated digital quantum simulator.

Abstract: The recent progress in the quantum optical formulation of the process of high harmonic generation has reached a point where the successful semi-classical model reaches its limitations. Until recently the light source which drives the process was considered to be provided by a laser, in agreement with the classical picture. However, quantum optics allows to consider light fields beyond the classical realm, such as bright squeezed vacuum or Fock states. Both field states have vanishing electric field amplitudes, but can still lead to the generation of high harmonic radiation for sufficiently high intensities. This poses new questions about the range of validity of the semi-classical picture, which is the matter discussed here.

Abstract: The Trotter decomposition is a basic approach to Hamiltonian simulation (digital quantum simulation). The first-order Trotter decomposition is the simplest one, whose deviations from target dynamics are of the first order of a small coefficient in terms of the infidelity. In this paper, we consider the first-order Trotter decomposition in the dynamical-invariant basis. By using a state-dependent inequality, we point out that deviations of this decomposition are of the second order of a small coefficient. Moreover, we also show that this decomposition includes a useful example, i.e., digital implementation of shortcuts to adiabaticity by counterdiabatic driving.

Abstract: The GAP package QDistRnd implements a probabilistic algorithm for finding the minimum distance of a quantum low-density parity-check code linear over a finite field GF(q). At each step several codewords are randomly drawn from a distribution biased toward smaller weights. The corresponding weights are used to update the upper bound on the distance, which eventually converges to the minimum distance of the code. While there is no performance guarantee, an empirical convergence criterion is given to estimate the probability that a minimum weight codeword has been found. In addition, a format for storing matrices associated with q-ary quantum codes is introduced and implemented via the provided import/export functions. The format, MTXE, is based on the well established MaTrix market eXchange (MTX) Coordinate format developed at NIST, and is designed for full backward compatibility with this format. Thus, MTXE files are readable by any software package which supports MTX.

Abstract: We study the quantum change point problem within the paradigm of local operations and classical communication (LOCC). Specifically, we consider a source that emits entangled pairs in a default state but undergoes mutation at some stage and begins producing an orthogonal entangled state. A sequence of entangled pairs prepared from such a source and shared between distant observers cannot be used for quantum information processing tasks as the identity of each entangled pair remains unknown. Assuming every point of a given sequence is equally likely to be the change point, including the possibility that no change occurs, we present a pretty-good LOCC protocol that identifies the change point and distills free entangled pairs. Next, we consider a variation of this problem where the source switches to an unknown entangled state that belongs to a known set. Here we show the local distinguishability of the collection of states, containing the default and all possible mutations, plays a crucial role: if they are locally distinguishable, the problem reduces to the previous one, but if not, one may still identify the mutated state, the change point, and distill entanglement, as we illustrate with a concrete example.

Abstract: The Toffoli gate takes a special place in the quantum information theory. It opens up a path for efficient implementation of complex quantum algorithms. Despite tremendous progress of the quantum processors based on the superconducting qubits, realization of a high-fidelity three-qubit operation is still a challenging problem. Here, we propose a novel way to perform a high-fidelity CCZ gate on fluxoniums capacitively connected via a transmon qubit, activated by a microwave pulse on the coupler. The main advantages of the approach are relative quickness, simplicity of calibration and significant suppression of the unwanted longitudinal ZZ interaction. We provide numerical simulation of 95-ns long gate of higher than 99.99% fidelity with realistic circuit parameters in the noiseless model and estimate an error of about 0.25% under the conventional decoherence rates.

Abstract: In this letter, we investigate the ground state properties of an optomechanical system consisting of a coupled cavity and mechanical modes. An exact solution is given when the ratio $\eta$ between the cavity and mechanical frequencies tends to infinity. This solution reveals a coherent photon occupation in the ground state by breaking continuous or discrete symmetries, exhibiting an equilibrium quantum phase transition (QPT). In the $U(1)$-broken phase, an unstable Goldstone mode can be excited. In the model featuring $Z_2$ symmetry, we discover the mutually (in the finite $\eta$) or unidirectionally (in $\eta \rightarrow \infty$) dependent relation between the squeezed vacuum of the cavity and mechanical modes. In particular, when the cavity is driven by a squeezed field along the required squeezing parameter, it enables modifying the region of $Z_2$-broken phase and significantly reducing the coupling strength to reach QPTs. Furthermore, by coupling atoms to the cavity mode, the hybrid system can undergo a QPT at a hybrid critical point, which is cooperatively determined by the optomechanical and light-atom systems. These results suggest that this optomechanical system complements other phase transition models for exploring novel critical phenomena.

Abstract: Linear bosonic modes offer a hardware-efficient alternative for quantum information processing but require access to some nonlinearity for universal control. The lack of nonlinearity in photonics has led to encoded measurement-based quantum computing, which rely on linear operations but requires access to resourceful ('nonlinear') quantum states, such as cubic phase states. In contrast, superconducting microwave circuits offer engineerable nonlinearities but suffer from static Kerr nonlinearity. Here, we demonstrate universal control of a bosonic mode composed of a superconducting nonlinear asymmetric inductive element (SNAIL) resonator, enabled by native nonlinearities in the SNAIL element. We suppress static nonlinearities by operating the SNAIL in the vicinity of its Kerr-free point and dynamically activate nonlinearities up to third order by fast flux pulses. We experimentally realize a universal set of generalized squeezing operations, as well as the cubic phase gate, and exploit them to deterministically prepare a cubic phase state in 60 ns. Our results initiate the experimental field of universal continuous-variables quantum computing.

Abstract: We have applied a machine learning algorithm to predict the emergence of environment-induced spontaneous synchronization between two qubits in an open system setting. In particular, we have considered three different models, encompassing global and local dissipation regimes, to describe the open system dynamics of the qubits. We have utilized the $k$-nearest neighbors algorithm to estimate the long time synchronization behavior of the qubits only using the early time expectation values of qubit observables in these three distinct models. Our findings clearly demonstrate the possibility of determining the occurrence of different synchronization phenomena with high precision even at the early stages of the dynamics using a machine learning-based approach. Moreover, we show the robustness of our approach against potential measurement errors in experiments by considering random errors in qubit expectation values. We believe that the presented results can prove to be useful in experimental studies on the determination of quantum synchronization.

Abstract: Quantum steering is an asymmetric form of quantum nonlocality where one can trust the measurements of one of the parties. In this work, inspired by practical considerations we investigate the scenario if one can not fully trust their measurement devices but only up to some precision. We first find the effect of such an imprecision on standard device-dependent quantum tomography. We then utilise this result to compute the variation in the local bound of any general steering inequality depending on the amount of trust one puts in one of the party's measurement devices. This is particularly important as we show that even a small distrust on Alice might cause the parties to observe steerability even if the quantum state is unsteerable. Furthermore, this effect becomes more relevant when observing higher dimensional quantum steering.

Abstract: We study quantum steering experiments without assuming that the trusted party can perfectly control their measurement device. Instead, we introduce a scenario in which these measurements are subject to small imprecision. We show that small measurement imprecision can have a large detrimental influence in terms of false positives for steering inequalities, and that this effect can become even more relevant for high-dimensional systems. We then introduce a method for taking generic measurement imprecision into account in tests of bipartite steering inequalities. The revised steering bounds returned by this method are analytical, easily computable, and are even optimal for well-known families of arbitrary-dimensional steering tests. Furthermore, it applies equally well to generalised quantum steering scenarios, where the shared quantum state does not need to be separable, but is instead limited by some other entanglement property.

Abstract: Optomechanical systems with parametric coupling between optical (photon) and mechanical (phonon) modes provide a useful platform to realize various magnetic-free nonreciprocal devices, such as isolators, circulators, and directional amplifiers. However, nonreciprocal router with multiaccess channels has not been extensively studied yet. Here, we propose a nonreciprocal router with one transmitter, one receiver, and two output terminals, based on an optomechanical plaquette composing of two optical modes and two mechanical modes. The time-reversal symmetry of the system is broken via synthetic magnetism induced by driving the two optical modes with phase-correlated laser fields. The prerequisites for nonreciprocal routing are obtained both analytically and numerically, and the robustness of the nonreciprocity is demonstrated numerically. Multi-terminal nonreciprocal router in optomechanical plaquette provides a useful quantum node for development of quantum network information security and realization of quantum secure communication.

Abstract: Given any pair of completely positive, trace-preserving maps $\Phi_1,\Phi_2$ such that at least one of them has Kraus rank one, as well as any respective Stinespring isometries $V_1,V_2$, we prove that there exists a unitary $U$ on the environment such that $\|V_1-({\bf1}\otimes U)V_2\|_\infty\leq\sqrt{2\|\Phi_1-\Phi_2\|_\diamond}$. Moreover, we provide a simple example which shows that the factor $\sqrt2$ on the right-hand side is optimal, and we conjecture that this inequality holds for every pair of channels.

Abstract: Quantum entanglement lies at the heart in quantum information processing tasks. Although many criteria have been proposed, efficient and scalable methods to detect the entanglement of generally given quantum states are still not available yet, particularly for high-dimensional and multipartite quantum systems. Based on FixMatch and Pseudo-Label method, we propose a deep semi-supervised learning model with a small portion of labeled data and a large portion of unlabeled data. The data augmentation strategies are applied in this model by using the convexity of separable states and performing local unitary operations on the training data. We verify that our model has good generalization ability and gives rise to better accuracies compared to traditional supervised learning models by detailed examples.

Abstract: The problem of how measurement in quantum mechanics takes place has existed since its formulation. Von Neumann proposed a scheme where he treated measurement as a two-part process -- a unitary evolution in the full system-ancilla space and then a projection onto one of the pointer states of the ancilla (representing the "collapse" of the wavefunction). The Lindblad master equation, which has been extensively used to explain dissipative quantum phenomena in the presence of an environment, can effectively describe the first part of the von Neumann measurement scheme when the jump operators in the master equation are Hermitian. We have proposed a non-Hermitian Hamiltonian formalism to emulate the first part of the von Neumann measurement scheme. We have used the embedding protocol to dilate a non-Hermitian Hamiltonian that governs the dynamics in the system subspace into a higher-dimensional Hermitian Hamiltonian that evolves the full space unitarily. We have obtained the various constraints and the required dimensionality of the ancilla Hilbert space in order to achieve the required embedding. Using this particular embedding and a specific projection operator, one obtains non-Hermitian dynamics in the system subspace that closely follow the Lindblad master equation. This work lends a new perspective to the measurement problem by employing non-Hermitian Hamiltonians.

Abstract: Geometry and topology have generated impacts far beyond their pure mathematical primitive, providing a solid foundation for many applicable tools. Typically, real-world data are represented as vectors, forming a linear subspace for a given data collection. Computing distances between different subspaces is generally a computationally challenging problem with both theoretical and applicable consequences, as, for example, the results can be used to classify data from different categories. Fueled by the fast-growing development of quantum algorithms, we consider such problems in the quantum context and provide a quantum algorithm for estimating two kinds of distance: Grassmann distance and ellipsoid distance. Under appropriate assumptions and conditions, the speedup of our quantum algorithm is exponential with respect to both the dimension of the given data and the number of data points. Some extensions regarding estimating different kinds of distance are then discussed as a corollary of our main quantum algorithmic method.

Abstract: The Pauli stabilizer formalism is perhaps the most thoroughly studied means of procuring quantum error-correcting codes, whereby the code is obtained through commutative Pauli operators and ``stabilized'' by them. In this work we will show that every quantum error-correcting code, including Pauli stabilizer codes and subsystem codes, has a similar structure, in that the code can be stabilized by commutative ``Paulian'' operators which share many features with Pauli operators and which form a \textbf{Paulian stabilizer group}. By facilitating a controlled gate we can measure these Paulian operators to acquire the error syndrome. Examples concerning codeword stabilized codes and bosonic codes will be presented; specifically, one of the examples has been demonstrated experimentally and the observable for detecting the error turns out to be Paulian, thereby showing the potential utility of this approach. This work provides a possible approach to implement error-correcting codes and to find new codes.

Abstract: The quantization of gravity is widely believed to result in gravitons -- particles of discrete energy that form gravitational waves. But their detection has so far been considered impossible. Here we show that signatures of single gravitons can be observed in laboratory experiments. We show that stimulated and spontaneous single-graviton processes can become relevant for massive quantum acoustic resonators and that stimulated absorption can be resolved through continuous sensing of quantum jumps. We analyze the feasibility of observing the exchange of single energy quanta between matter and gravitational waves. Our results show that single graviton signatures are within reach of experiments. In analogy to the discovery of the photo-electric effect for photons, such signatures can provide the first experimental evidence of the quantization of gravity.

Abstract: The quantum alternating operator ansatz (QAOA) is a heuristic hybrid quantum-classical algorithm for finding high-quality approximate solutions to combinatorial optimization problems, such as Maximum Satisfiability. While QAOA is well-studied, theoretical results as to its runtime or approximation ratio guarantees are still relatively sparse. We provide some of the first lower bounds for the number of rounds (the dominant component of QAOA runtimes) required for QAOA. For our main result, (i) we leverage a connection between quantum annealing times and the angles of QAOA to derive a lower bound on the number of rounds of QAOA with respect to the guaranteed approximation ratio. We apply and calculate this bound with Grover-style mixing unitaries and (ii) show that this type of QAOA requires at least a polynomial number of rounds to guarantee any constant approximation ratios for most problems. We also (iii) show that the bound depends only on the statistical values of the objective functions, and when the problem can be modeled as a $k$-local Hamiltonian, can be easily estimated from the coefficients of the Hamiltonians. For the conventional transverse field mixer, (iv) our framework gives a trivial lower bound to all bounded occurrence local cost problems and all strictly $k$-local cost Hamiltonians matching known results that constant approximation ratio is obtainable with constant round QAOA for a few optimization problems from these classes. Using our novel proof framework, (v) we recover the Grover lower bound for unstructured search and -- with small modification -- show that our bound applies to any QAOA-style search protocol that starts in the ground state of the mixing unitaries.

Abstract: We consider scattering processes where a quantum system is comprised of an inner subsystem and of a boundary, and is subject to Haar-averaged random unitaries acting on the boundary-environment Hilbert space only. We show that, regardless of the initial state, a single scattering event will disentangle the unconditional state (i.e., the scattered state when no information about the applied unitary is available) across the inner subsystem-boundary partition. Also, we apply Levy's lemma to constrain the trace norm fluctuations around the unconditional state. Finally, we derive analytical formulae for the mean scattered purity for initial globally pure states, and provide one with numerical evidence of the reduction of fluctuations around such mean values with increasing environmental dimension.

Abstract: We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm in the impulse regime, that is, where the counterdiabatic terms are dominant. Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors. We apply this protocol to a real-case scenario of portfolio optimization with 20 assets, using purely quantum and hybrid classical-quantum paradigms. We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer. By benchmarking our method against the standard quantum approximate optimization algorithm and finite-time digitized-adiabatic algorithms, we obtain a significant reduction in the circuit depth by factors of 2.5 to 40, while minimizing the dependence on the classical optimization subroutine. Besides portfolio optimization, the proposed method is applicable to a large class of combinatorial optimization problems.