We test the principle of majorization [J. I. Latorre and M. A. Martin-Delgado, Phys. Rev. A 66, 022305 (2002)] in random circuits. Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. The studied families are: {CNOT, H, T}, {CNOT, H, NOT}, {CNOT, H, S} (Clifford), matchgates, and IQP (instantaneous quantum polynomial-time). We verified that all the families of circuits satisfy on average the principle of decreasing majorization. In most cases the asymptotic state (number of gates going to infinity) behaves like a random vector. However, clear differences appear in the fluctuations of the Lorenz curves associated to asymptotic states. The fluctuations of the Lorenz curves discriminate between universal and non-universal classes of random quantum circuits, and they also detect the complexity of some non-universal but not classically efficiently simulatable quantum random circuits. We conclude that majorization can be used as a indicator of complexity of quantum dynamics, as an alternative to, e.g., entanglement spectrum and out-of-time-order correlators (OTOCs).
The Majorization Principle is a fundamental statement governing the dynamics of information processing in optimal and efficient quantum algorithms. While quantum computation can be modeled to be reversible, due to the unitary evolution undergone by the system, these quantum algorithms are conjectured to obey a quantum arrow of time dictated by the Majorization Principle: the probability distribution associated to the outcomes gets ordered step-by-step until achieving the result of the computation. Here we report on the experimental observation of the effects of the Majorization Principle for t…
We study the characterisation of efficient and non-efficient families of Grover's algorithms according to the majorization principle. We develop a geometrical interpretation based on the parameters that appears on these algorithms. Using this interpretation we observe a step-by-step majorization in all efficient Grover's algorithms, whereas the non-efficient Grover's algorithms fail to abide by this majorization principle. These Majorization results are first obtained from numerical calculations. Motivated by these numerical results, we also obtained an analytical demonstration. Finally, the g…
Heisenberg's uncertainty principle is formulated for a set of generalized measurements within the framework of majorization theory, resulting in a partial uncertainty order on probability vectors that is stronger than those based on quasi-entropic measures. The theorem that results from this formulation guarantees that the uncertainty of the results of a set of generalized measurements without a common eigenstate has an inviolable lower bound which depends on the measurement set but not the state. A corollary to this theorem yields a parallel formulation of the uncertainty principle for genera…
We apply majorization theory to study the quantum algorithms known so far and find that there is a majorization principle underlying the way they operate. Grover's algorithm is a neat instance of this principle where majorization works step by step until the optimal target state is found. Extensions of this situation are also found in algorithms based in quantum adiabatic evolution and the family of quantum phase-estimation algorithms, including Shor's algorithm. We state that in quantum algorithms the time arrow is a majorization arrow.
Motivated by the need to uncover some underlying mathematical structure of optimal quantum computation, we carry out a systematic analysis of a wide variety of quantum algorithms from the majorization theory point of view. We conclude that step-by-step majorization is found in the known instances of fast and efficient algorithms, namely in the quantum Fourier transform, in Grover's algorithm, in the hidden affine function problem, in searching by quantum adiabatic evolution and in deterministic quantum walks in continuous time solving a classically hard problem. On the other hand, the optimal …
We design a series of quantum circuits that generate absolute maximally entangled (AME) states to benchmark a quantum computer. A relation between graph states and AME states can be exploited to optimize the structure of the circuits and minimize their depth. Furthermore, we find that most of the provided circuits obey majorization relations for every partition of the system, and at every step of the quantum computation. The rational for our approach is to benchmark quantum computers with maximal useful entanglement, which can be used to implement multipartite quantum protocols.
We develop a general operational framework that formalizes the concept of conditional uncertainty in a measure-independent fashion. Our formalism is built upon a mathematical relation which we call conditional majorization. We define conditional majorization and, for the case of classical memory, we provide its thorough characterization in terms of monotones, i.e., functions that preserve the partial order under conditional majorization. We demonstrate the application of this framework by deriving two types of memory-assisted uncertainty relations: (1) a monotone-based conditional uncertainty …
The uncertainty principle bounds the uncertainties about incompatible measurements, clearly setting quantum theory apart from the classical world. Its mathematical formulation via uncertainty relations, plays an irreplaceable role in quantum technologies. However, neither the uncertainty principle nor uncertainty relations can fully describe the complementarity between quantum measurements. As an attempt to advance the efforts of complementarity in quantum theories, we formally propose a complementary information principle, significantly extending the one introduced by Heisenberg. First, we bu…
The uncertainty principle and entanglement are two fundamental, but yet not well understood, features of quantum theory. The uncertainty relation reflects the capability limit in acquiring the knowledge of different physical properties of a particle simultaneously, while on the other side, the quantum entanglement renders the entangled quanta lose their independence, including measurements imposed on them. By virtue of the majorization, here we establish a general correlation relation for quantum uncertainty and multipartite entanglement. Within this scheme, the optimization problems for entro…
What does it mean for one quantum process to be more disordered than another? Here we provide a precise answer to this question in terms of a quantum-mechanical generalization of majorization. The framework admits a complete description in terms of single-shot entropies, and provides a range of significant applications. These include applications to the comparison of quantum statistical models and quantum channels, to the resource theory of asymmetry, and to quantum thermodynamics. In particular, within quantum thermodynamics, we apply our results to provide the first complete set of of necess…
This thesis consists of two parts. The first part is about how quantum theory can be recovered from first principles, while the second part is about the application of diagrammatic reasoning, specifically the ZX-calculus, to practical problems in quantum computing. The main results of the first part include a reconstruction of quantum theory from principles related to properties of sequential measurement and a reconstruction based on properties of pure maps and the mathematics of effectus theory. It also includes a detailed study of JBW-algebras, a type of infinite-dimensional Jordan algebra m…
This paper highlights a practical research of the possibility of forming quantum circuits for training neural networks. The demonstrated quantum circuits were based on the principles of Grover's Search Algorithm. The perceptron was chosen as the architecture for the example neural network. The multilayer perceptron is a popular neural network architecture due to its scalability and applicability for solving a wide range of problems.
In the paper an approach is presented allowing to model quantum logic circuits by electronic gates for discrete spatially modulated electromagnetic signals. The designed circuitry is for modeling low scale quantum nets of general design and quantum devices based only on superposition principle of their work.
We define syntax and semantics of quantum circuits, allowing measurement gates and classical channels. We define circuit-based quantum algorithms and prove that, semantically, any such algorithm is equivalent to a single measurement that depends only on the underlying quantum circuit. Finally, we use our formalization of quantum circuits to state precisely and prove the principle of deferred measurements.
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other models of quantum computation exist which provide useful alternative frameworks for both discovering new quantum algorithms and devising new physical implementations of quantum computers. In this thesis, I first present necessary background material for a general physics audience and discuss existing models of quantum computation. Then, I present three result…
Scalable photonic quantum technologies are based on multiple nested interferometers. To realize this architecture, integrated optical structures are needed to ensure stable, controllable, and repeatable operation. Here we show a key proof-of-principle demonstration of an externally-controlled photonic quantum circuit based upon UV-written waveguide technology. In particular, we present non-classical interference of photon pairs in a Mach-Zehnder interferometer constructed with X couplers in an integrated optical circuit with a thermo-optic phase shifter in one of the interferometer arms.
We investigate the Cherenkov radiation triggered by qubit acceleration simulated by superconducting circuit. By analyzing the radiation probability, we confirm the existence of Cherenkov speed threshold, implying that simulating superluminal qubit motion is possible for such a scenario. A question immediately arises: Is such motion compatible with the causality principle? To address the question, we perform a causality test on the simulating system based on the recently developed notion of temporal quantum correlations, pseudo-density matrix and temporal quantum steering. The results suggest t…
The development of quantum computing technologies builds on the unique features of quantum physics while borrowing familiar principles from the design of conventional devices. We introduce the fundamental concepts required for designing and operating quantum computing devices by reviewing state of the art efforts to fabricate and demonstrate quantum gates and qubits. We summarize the near-term challenges for devices based on semiconducting, superconducting, and trapped ion technologies with an emphasis on design tools as well as methods of verification and validation. We then discuss the gener…
Quantum technologies based on photons are anticipated in the areas of information processing, communication, metrology, and lithography. While there have been impressive proof-of-principle demonstrations in all of these areas, future technologies will likely require an integrated optics architecture for improved performance, miniaturization and scalability. We demonstrated high- fidelity silica-on-silicon integrated optical realizations of key quantum photonic circuits, including two-photon quantum interference with a visibility of 94.8(5)%; a controlled-NOT gate with logical basis fidelity of…
Artificial atoms realized by superconducting circuits offer unique opportunities to store and process quantum information with high fidelity. Among them, implementations of circuits that harness intrinsic noise protection have been rapidly developed in recent years. These noise-protected devices constitute a new class of qubits in which the computational states are largely decoupled from local noise channels. The main challenges in engineering such systems are simultaneously guarding against both bit- and phase-flip errors, and also ensuring high-fidelity qubit control. Although partial noise …
Diners dilemma is one of the most interesting problems in both economic and game theories. Here, we solve this problem for n (number of players) =4 with quantum rules and we are able to remove the dilemma of diners between the Pareto optimal and Nash equilibrium points of the game. We find the quantum strategy that gives maximum payoff for each diner without affecting the payoff and strategy of others. We use the quantum principles of superposition and entanglement that gives supremacy over any classical strategies. We present the circuit implementation for the game, design it on the IBM quant…
Lately, much attention has been given to quantum algorithms that solve pattern recognition tasks in machine learning. Many of these quantum machine learning algorithms try to implement classical models on large-scale universal quantum computers that have access to non-trivial subroutines such as Hamiltonian simulation, amplitude amplification and phase estimation. We approach the problem from the opposite direction and analyse a distance-based classifier that is realised by a simple quantum interference circuit. After state preparation, the circuit only consists of a Hadamard gate as well as t…
One-way measurement based quantum computations (1WQC) may describe unitary transformations, via a composition of CPTP maps which are not all unitary themselves. This motivates the following decision problems: Is it possible to determine whether a ``quantum-to-quantum'' 1WQC procedure (having non-trivial input and output subsystems) performs a unitary transformation? Is it possible to describe precisely how such computations transform quantum states, by translation to a quantum circuit of comparable complexity? In this article, we present an efficient algorithm for transforming certain families…
We introduce an axiomatic approach for characterizing quantum conditional entropy. Our approach relies on two physically motivated axioms: monotonicity under conditional majorization and additivity. We show that these two axioms provide sufficient structure that enable us to derive several key properties applicable to all quantum conditional entropies studied in the literature. Specifically, we prove that any quantum conditional entropy must be negative on certain entangled states and must equal -log(d) on dxd maximally entangled states. We also prove the non-negativity of conditional entropy …
We present recursive multiport schemes for implementing quantum Fourier transforms and the inversion step in Grover's algorithm on an integrated linear optics device. In particular, each scheme shows how to execute a quantum operation on $2d$ modes using a pair of circuits for the same operation on $d$ modes. The circuits operate on path-encoded qudits and realize $d$-dimensional unitary transformations on these states using linear optical networks with $O\left(d^2\right)$ optical elements. To evaluate the schemes against realistic errors, we ran simulations of proof-of-principle experiments u…
We focus on a recently experimentally realized scenario of normal-metal-insulator-superconductor tunnel junctions coupled to a superconducting resonator. We develop a first-principles theory to describe the effect of photon-assisted electron tunneling on the quantum state of the resonator. Our results are in very good quantitative agreement with the previous experiments on refrigeration and heating of the resonator using the photon-assisted tunneling, thus providing a stringent verification of the developed theory. Importantly, our results provide simple analytical estimates of the voltage-tun…
An asymmetric atom trap is investigated as a means to implement a "battery" that supplies ultracold atoms to an atomtronic circuit. The battery model is derived from a scheme for continuous loading of a non-dissipative atom trap proposed by Roos et al.(Europhysics Letters V61, 187 (2003)). The trap is defined by longitudinal and transverse trap frequencies and corresponding trap energy heights. The battery's ability to supply power to a load is evaluated as a function of an input atom flux and power. For given trap parameters and input flux the battery is shown to have a resonantly optimum val…
Quantum circuit depth minimization is critical for practical applications of circuit-based quantum computation. In this work, we present a systematic procedure to decompose multiqubit controlled unitary gates, which is essential in many quantum algorithms, to controlled-NOT and single-qubit gates with which the quantum circuit depth only increases linearly with the number of control qubits. Our algorithm does not require any ancillary qubits and achieves a quadratic reduction of the circuit depth against known methods. We show the advantage of our algorithm with proof-of-principle experiments …
The topic area of this paper parameterized quantum circuits (quantum neural networks) which are trained to estimate a given function, specifically the type of circuits proposed by Mitarai et al. (Phys. Rev. A, 2018). The input is encoded into amplitudes of states of qubits. The no-cloning principle of quantum mechanics suggests that there is an advantage in redundantly encoding the input value several times. We follow this suggestion and prove lower bounds on the number of redundant copies for two types of input encoding. We draw conclusions for the architecture design of QNNs.
We introduce a novel hybrid algorithm to simulate the real-time evolution of quantum systems using parameterized quantum circuits. The method, named "projected - Variational Quantum Dynamics" (p-VQD) realizes an iterative, global projection of the exact time evolution onto the parameterized manifold. In the small time-step limit, this is equivalent to the McLachlan's variational principle. Our approach is efficient in the sense that it exhibits an optimal linear scaling with the total number of variational parameters. Furthermore, it is global in the sense that it uses the variational principl…
Holographic complexity proposals have sparked interest in quantifying the cost of state preparation in quantum field theories and its possible dual gravitational manifestations. The most basic ingredient in defining complexity is the notion of a class of circuits that, when acting on a given reference state, all produce a desired target state. In the present work we build on studies of circuits performing local conformal transformations in general two-dimensional conformal field theories and construct the exact gravity dual to such circuits. In our approach to holographic complexity, the gravi…
We theoretically propose a scheme for a spin quantum bit based on a double quantum dot contacted to ferromagnetic elements. Interface exchange effects enable an all electric manipulation of the spin and a switchable strong coupling to a superconducting coplanar waveguide cavity. Our setup does not rely on any specific band structure and can in principle be realized with many different types of nanoconductors. This allows to envision on-chip single spin manipulation and read-out using cavity QED techniques.
We demonstrate that important information about linear optical circuits can be obtained through the phase shift induced by integrated optical resonators. As a proof of principle, the phase of an unbalanced Mach-Zehnder interferometer is determined. Then the method is applied to a complex optical circuit designed for linear optical quantum computation. In this controlled-NOT gate with qubit initialization and tomography stages, the relative phases are determined as well as the coupling ratios of its directional couplers.
Toy models for quantum evolution in the presence of closed timelike curves (CTCs) have gained attention in the recent literature due to the strange effects they predict. The circuits that give rise to these effects appear quite abstract and contrived, as they require non-trivial interactions between the future and past which lead to infinitely recursive equations. We consider the special case in which there is no interaction inside the CTC, referred to as an open timelike curve (OTC), for which the only local effect is to increase the time elapsed by a clock carried by the system. Remarkably, …
Quantum many-body scars in random unitary circuits
Université Paris-Saclay（巴黎萨克雷大学）；CNRS（法国国家科学研究中心）；Laboratoire de Physique de l’École normale supérieure（巴黎高等师范学院物理实验室）；ENS（巴黎高等师范学院）；Université PSL（巴黎文理研究大学）；Sorbonne Université（索邦大学）；Université Paris Cité（巴黎西岱大学）
Satisfiability Testing (SAT) techniques are well-established in classical computing where they are used to solve a broad variety of problems, e.g., in the design of classical circuits and systems. Analogous to the classical realm, quantum algorithms are usually modelled as circuits and similar design tasks need to be tackled. Thus, it is natural to pose the question whether these design tasks in the quantum realm can also be approached using SAT techniques. To the best of our knowledge, no SAT formulation for arbitrary quantum circuits exists and it is unknown whether such an approach is feasi…
Variational Quantum Circuits (VQCs), or the so-called quantum neural-networks, are predicted to be one of the most important near-term quantum applications, not only because of their similar promises as classical neural-networks, but also because of their feasibility on near-term noisy intermediate-size quantum (NISQ) machines. The need for gradient information in the training procedure of VQC applications has stimulated the development of auto-differentiation techniques for quantum circuits. We propose the first formalization of this technique, not only in the context of quantum circuits but …
Atomtronics is an emerging field that aims to manipulate ultracold atom moving in matter wave circuits for both fundamental studies in quantum science and technological applications. In this colloquium, we review recent progress in matter-wave circuitry and atomtronics-based quantum technology. After a short introduction to the basic physical principles and the key experimental techniques needed to realize atomtronic systems, we describe the physics of matter-waves in simple circuits such as ring traps and two-terminal systems. The main experimental observations and outstanding questions are d…
This short and opinionated review starts with a concept of quantum signals at microwave frequencies and focuses on the principle of linear parametric amplification. The amplification process arises from the dispersive nonlinearity of Josephson junctions driven with appropriate tones. We discuss two defining characteristics of these amplifiers: the number of modes receiving the signal, idler and pump waves and the number of independent ports through which these waves enter into the circuit.
