SearcharxivSearch

arXiv subjects

P. Perinotti

Publications and source records attributed to P. Perinotti.

At least 19 recordsLinked to original sources

Quantum field theory from first principles

If the systems of quantum theory are thought of as elementary information carriers in the first place, rather than elementary constituents of matter, and their connections are logical connections within a given algorithm, rather than space-time relations, then we need to find the origin of mechanical concepts---that characterise quantum mechanics as a theory of physical systems. To this end, we will illustrate how physical laws can be viewed as algorithms for the update of memory registers that make a physical system. Imposing the characteristic properties of physical laws to such an algorithm, i.e. homogeneity, reversibility and isotropy, we will show that the physical laws thus selected are particular algorithms known as cellular automata. Further assumptions regarding maximal simplicity of the algorithm lead to two cellular automata only, that in a suitable regime can be described by Weyl's differential equations, lying at the basis of the dynamics of relativistic quantum fields. We will finally discuss how the same cellular automaton can give rise to both Fermionic field dynamics and to Maxwell's equations, that rule the dynamics of the electromagnetic field. We will conclude reviewing the discussion of the relativity principle, that must be suitably adapted to the scenario where space-time is not an elementary notion, through the definition of a change of inertial reference frame, and whose formulation leads to the recovery of the symmetry of Minkowski space-time, identified with Poincar\'e's group. Space-time thus emerges as one of the manifestations of physical laws, rather than the background where they occur, and its features are determined by the dynamics of systems, necessarily equipped with differential equations that express it. In brief, there is no space-time unless an evolution rule requires it.

quant-ph

The Thirring quantum cellular automaton

We analytically diagonalize a discrete-time on-site interacting fermionic cellular automaton in the two-particle sector. Important features of the solutions sensibly differ from those of analogous Hamiltonian models. In particular, we found a wider variety of scattering processes, we have bound states for every value of the total momentum, and there exist bound states also in the free case, where the coupling constant is null.

quant-ph

Derivation of the Dirac Equation from Principles of Information Processing

We show how the Dirac equation in three space-dimensions emerges from the large-scale dynamics of the minimal nontrivial quantum cellular automaton satisfying unitariety, locality, homogeneity, and discrete isotropy, without using the relativity principle. The Dirac equation is recovered for small wave-vector and inertial mass, whereas Lorentz covariance is distorted in the ultra-relativistic limit. The automaton can thus be regarded as a theory unifying scales from Planck to Fermi. A simple asymptotic approach leads to a dispersive Schroedinger equation describing the evolution of narrow-band states at all scales.

quant-ph

Discrete Feynman propagator for the Weyl quantum walk in 2+1 dimensions

Recently quantum walks have been considered as a possible fundamental description of the dynamics of relativistic quantum fields. Within this scenario we derive the analytical solution of the Weyl walk in 2+1 dimensions. We present a discrete path-integral formulation of the Feynman propagator based on the binary encoding of paths on the lattice. The derivation exploits a special feature of the Weyl walk, that occurs also in other dimensions, that is closure under multiplication of the set of the walk transition matrices. This result opens the perspective of a similar solution in the 3+1 case.

quant-ph

Quantum computations without definite causal structure

We show that quantum theory allows for transformations of black boxes that cannot be realized by inserting the input black boxes within a circuit in a pre-defined causal order. The simplest example of such a transformation is the classical switch of black boxes, where two input black boxes are arranged in two different orders conditionally on the value of a classical bit. The quantum version of this transformation-the quantum switch-produces an output circuit where the order of the connections is controlled by a quantum bit, which becomes entangled with the circuit structure. Simulating these transformations in a circuit with fixed causal structure requires either postselection, or an extra query to the input black boxes.

quant-ph

Doubly-Special Relativity from Quantum Cellular Automata

It is shown how a Doubly-Special Relativity model can emerge from a quantum cellular automaton description of the evolution of countably many interacting quantum systems. We consider a one-dimensional automaton that spawns the Dirac evolution in the relativistic limit of small wave-vectors and masses (in Planck units). The assumption of invariance of dispersion relations for boosted observers leads to a non-linear representation of the Lorentz group on the $(ω,k)$ space, with an additional invariant given by the wave-vector $k=π/2$. The space-time reconstructed from the $(ω,k)$ space is intrinsically quantum, and exhibits the phenomenon of relative locality.

quant-ph

Quantum Theory, namely the pure and reversible theory of information

After more than a century since its birth, Quantum Theory still eludes our understanding. If asked to describe it, we have to resort to abstract and ad hoc principles about complex Hilbert spaces. How is it possible that a fundamental physical theory cannot be described using the ordinary language of Physics? Here we offer a contribution to the problem from the angle of Quantum Information, providing a short non-technical presentation of a recent derivation of Quantum Theory from information-theoretic principles. The broad picture emerging from the principles is that Quantum Theory is the only standard theory of information compatible with the purity and reversibility of physical processes.

quant-ph

Teleportation transfers only speakable quantum information

We show that a quantum clock cannot be teleported without prior synchronization between sender and receiver: every protocol using a finite amount of entanglement and an arbitrary number of rounds of classical communication will necessarily introduce an error in the teleported state of the clock. Nevertheless, we show that entanglement can be used to achieve synchronization with precision higher than any classical correlation allows, and we give the optimized strategy for this task. The same results hold also for arbitrary continuous quantum reference frames, which encode general unspeakable information,-information that cannot be encoded into a number, but instead requires a specific physical support, like a clock or a gyroscope, to be conveyed.

quant-ph

Informational derivation of Quantum Theory

Quantum theory can be derived from purely informational principles. Five elementary axioms-causality, perfect distinguishability, ideal compression, local distinguishability, and pure conditioning-define a broad class of theories of information-processing that can be regarded as a standard. One postulate-purification-singles out quantum theory within this class. The main structures of quantum theory, such as the representation of mixed states as convex combinations of perfectly distinguishable pure states, are derived directly from the principles without using the Hilbert space framework.

quant-ph

Probabilistic theories with purification

We investigate general probabilistic theories in which every mixed state has a purification, unique up to reversible channels on the purifying system. We show that the purification principle is equivalent to the existence of a reversible realization of every physical process, namely that every physical process can be regarded as arising from a reversible interaction of the system with an environment, which is eventually discarded. From the purification principle we also construct an isomorphism between transformations and bipartite states that possesses all structural properties of the Choi-Jamiolkowski isomorphism in quantum mechanics. Such an isomorphism allows one to prove most of the basic features of quantum mechanics, like e.g. existence of pure bipartite states giving perfect correlations in independent experiments, no information without disturbance, no joint discrimination of all pure states, no cloning, teleportation, no programming, no bit commitment, complementarity between correctable channels and deletion channels, characterization of entanglement-breaking channels as measure-and-prepare channels, and others, without resorting to the mathematical framework of Hilbert spaces.

quant-ph

Optimal quantum learning of a unitary transformation

We address the problem of learning an unknown unitary transformation from a finite number of examples. The problem consists in finding the learning machine that optimally emulates the examples, thus reproducing the unknown unitary maximum fidelity. Learning a unitary is equivalent to storing it in the state of a quantum memory (the memory of the learning machine), and subsequently retrieving it. We prove that, whenever the unknown unitary is drawn from a group, the optimal strategy consists in a parallel call of the available uses followed by a "measure-and-rotate" retrieving. Differing from the case of quantum cloning, where the incoherent "measure-and-prepare" strategies are typically suboptimal, in the case of learning the "measure-and-rotate" strategy is optimal even when the learning machine is asked to reproduce a single copy of the unknown unitary. We finally address the problem of the optimal inversion of an unknown unitary evolution, showing also in this case the optimality of the "measure-and-rotate" strategies and applying our result to the optimal approximate realignment of reference frames for quantum communication.

quant-ph

A short impossibility proof of Quantum Bit Commitment

Bit commitment protocols, whose security is based on the laws of quantum mechanics alone, are generally held to be impossible on the basis of a concealment-bindingness tradeoff. A strengthened and explicit impossibility proof has been given in: G. M. D'Ariano, D. Kretschmann, D. Schlingemann, and R. F. Werner, Phys. Rev. A 76, 032328 (2007), in the Heisenberg picture and in a C*-algebraic framework, considering all conceivable protocols in which both classical and quantum information are exchanged. In the present paper we provide a new impossibility proof in the Schrodinger picture, greatly simplifying the classification of protocols and strategies using the mathematical formulation in terms of quantum combs, with each single-party strategy represented by a conditional comb. We prove that assuming a stronger notion of concealment--worst-case over the classical information histories--allows Alice's cheat to pass also the worst-case Bob's test. The present approach allows us to restate the concealment-bindingness tradeoff in terms of the continuity of dilations of probabilistic quantum combs with respect to the comb-discriminability distance.

quant-ph

Optimal cloning of unitary transformations

After proving a general no-cloning theorem for black boxes, we derive the optimal universal cloning of unitary transformations, from one to two copies. The optimal cloner is realized by quantum channels with memory, and greately outperforms the optimal measure-and-reprepare cloning strategy. Applications are outlined, including two-way quantum cryptographic protocols.

quant-ph

Adaptive Bayesian and frequentist data processing for quantum tomography

The outcome statistics of an informationally complete quantum measurement for a system in a given state can be used to evaluate the ensemble expectation of any linear operator in the same state, by averaging a function of the outcomes that depends on the specific operator. Here we introduce two novel data-processing strategies, non-linear in the frequencies, which lead to faster convergence to theoretical expectations.

quant-ph

Optimal covariant quantum networks

A sequential network of quantum operations is efficiently described by its quantum comb, a non-negative operator with suitable normalization constraints. Here we analyze the case of networks enjoying symmetry with respect to the action of a given group of physical transformations, introducing the notion of covariant combs and testers, and proving the basic structure theorems for these objects. As an application, we discuss the optimal alignment of reference frames (without pre-established common references) with multiple rounds of quantum communication, showing that i) allowing an arbitrary amount of classical communication does not improve the alignment, and ii) a single round of quantum communication is sufficient.

quant-ph

Transforming quantum operations: quantum supermaps

We introduce the concept of quantum supermap, describing the most general transformation that maps an input quantum operation into an output quantum operation. Since quantum operations include as special cases quantum states, effects, and measurements, quantum supermaps describe all possible transformations between elementary quantum objects (quantum systems as well as quantum devices). After giving the axiomatic definition of supermap, we prove a realization theorem, which shows that any supermap can be physically implemented as a simple quantum circuit. Applications to quantum programming, cloning, discrimination, estimation, information-disturbance trade-off, and tomography of channels are outlined.

quant-ph