arXiv subjects

Alex Wozniakowski

Publications and source records attributed to Alex Wozniakowski.

7 recordsLinked to original sources

arXiv2020

Boosting on the shoulders of giants in quantum device calibration

Traditional machine learning applications, such as optical character recognition, arose from the inability to explicitly program a computer to perform a routine task. In this context, learning algorithms usually derive a model exclusively from the evidence present in a massive dataset. Yet in some scientific disciplines, obtaining an abundance of data is an impractical luxury, however; there is an explicit model of the domain based upon previous scientific discoveries. Here we introduce a new approach to machine learning that is able to leverage prior scientific discoveries in order to improve generalizability over a scientific model. We show its efficacy in predicting the entire energy spectrum of a Hamiltonian on a superconducting quantum device, a key task in present quantum computer calibration. Our accuracy surpasses the current state-of-the-art by over $20\%.$ Our approach thus demonstrates how artificial intelligence can be further enhanced by "standing on the shoulders of giants."

quant-ph↗

arXiv2017

Holographic Software for Quantum Networks

We introduce a pictorial approach to quantum information, called holographic software. Our software captures both algebraic and topological aspects of quantum networks. It yields a bi-directional dictionary to translate between a topological approach and an algebraic approach. Using our software, we give a topological simulation for quantum networks. The string Fourier transform (SFT) is our basic tool to transform product states into states with maximal entanglement entropy. We obtain a pictorial interpretation of Fourier transformation, of measurements, and of local transformations, including the $n$-qudit Pauli matrices and their representation by Jordan-Wigner transformations. We use our software to discover interesting new protocols for multipartite communication. In summary, we build a bridge linking the theory of planar para algebras with quantum information.

quant-ph↗

arXiv2017

Covert Quantum Internet

We apply covert quantum communication based on entanglement generated from the Minkowski vacuum to the setting of quantum computation and quantum networks. Our approach hides the generation and distribution of entanglement in quantum networks by taking advantage of relativistic quantum effects. We devise a suite of covert quantum teleportation protocols that utilize the shared entanglement, local operations, and covert classical communication to transfer or process quantum information in stealth. As an application of our covert suite, we construct two prominent examples of measurement-based quantum computation, namely the teleportation-based quantum computer and the one-way quantum computer. In the latter case we explore the covert generation of graph states, and subsequently outline a protocol for the covert implementation of universal blind quantum computation.

quant-ph↗

arXiv2017

Quons: A 3D Language for Quantum Information

We present a 3D, topological picture-language for quantum information. Our approach combines charged excitations carried by strings, with topological properties that arise from embedding the strings in the interior of a three-dimensional manifold with boundary. A quon is a composite that acts as a particle. Specifically a quon is a hemisphere containing a neutral pair of open strings with opposite charge. We interpret multi-quons and their transformations in a natural way. We obtain a new type of relation, a string-genus "joint relation," involving both a string and the 3D manifold. We use the joint relation to obtain a topological interpretation of the $C^{*}$ Hopf algebra relations, that are widely used in tensor networks. We obtain a 3D representation of the Controlled NOT or CNOT gate (that is considerably simpler than earlier work) and a 3D topological protocol for teleportation.

quant-ph↗

arXiv2017

Constructive Simulation and Topological Design of Protocols

We give a topological simulation for tensor networks that we call the two-string model. In this approach we give a new way to design protocols, and we discover a new multipartite quantum communication protocol. We introduce the notion of topologically-compressed transformations. Our new protocol can implement multiple, non-local compressed transformations among multi-parties using one multipartite resource state.

quant-ph↗

arXiv2016

Compressed Teleportation

In a previous paper we introduced holographic software for quantum networks, inspired by work on planar para algebras. This software suggests the definition of a compressed transformation. Here we utilize the software to find a CT protocol to teleport compressed transformations. This protocol serves multiple parties with multiple persons.

quant-ph↗

arXiv2016

Qudit Isotopy

We explore a general diagrammatic framework to understand qudits and their braiding, especially in its relation to entanglement. This involves understanding the role of isotopy in interpreting diagrams that implement entangling gates as well as some standard quantum information protocols. We give qudit Pauli operators $X,Y,Z$ and comment on their structure, both from an algebraic and from a diagrammatic point of view. We explain alternative models for diagrammatic interpretations of qudits and their transformations. We use our diagrammatic approach to define an entanglement-relay protocol for long-distance entanglement. Our approach rests on algebraic and topological relations discovered in the study of planar para algebras. In summary, this work provides bridges between the new theory of planar para algebras and quantum information, especially in questions involving entanglement.

quant-ph↗