Quantum Maxflow/Mincut
Abstract
The classical maxflow mincut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. By associating an integral capacity to each edge and a tensor to each vertex in a flow network, we can also interpret it as a tensor network and, more specifically, as a linear map from the input space to the output space. The quantum maxflow is defined to be the maximal rank of this linear map over all choices of tensors. The quantum mincut is defined to be the minimum product of the capacities of edges over all cuts of the tensor network. We show that unlike the classical case, the quantum maxflow=mincut conjecture is not true in general. Under certain conditions, e.g., when the capacity on each edge is some power of a fixed integer, the quantum maxflow is proved to equal the quantum mincut. However, concrete examples are also provided where the equality does not hold. We also found connections of quantum maxflow/mincut with entropy of entanglement and the quantum satisfiability problem. We speculate that the phenomena revealed may be of interest both in spin systems in condensed matter and in quantum gravity.
 Authors:
 Department of Mathematics, University of California, Santa Barbara, California 93106 (United States)
 (United States)
 Computer Science Division, University of California, Berkeley, California 94720 (United States)
 Center for Communications Research, La Jolla, California 92121 (United States)
 Publication Date:
 OSTI Identifier:
 22596848
 Resource Type:
 Journal Article
 Resource Relation:
 Journal Name: Journal of Mathematical Physics; Journal Volume: 57; Journal Issue: 6; Other Information: (c) 2016 Author(s); Country of input: International Atomic Energy Agency (IAEA)
 Country of Publication:
 United States
 Language:
 English
 Subject:
 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; ENTROPY; INTEGRALS; QUANTUM ENTANGLEMENT; QUANTUM GRAVITY; TENSORS
Citation Formats
Cui, Shawn X., Email: xingshan@math.ucsb.edu, Quantum Architectures and Computation Group, Microsoft Research, Redmond, Washington 98052, Freedman, Michael H., Email: michaelf@microsoft.com, Microsoft Research, Station Q, University of California, Santa Barbara, California 93106, Sattath, Or, Email: sattath@gmail.com, Stong, Richard, Email: stong@ccrwest.org, and Minton, Greg, Email: gtminto@ccrwest.org. Quantum Maxflow/Mincut. United States: N. p., 2016.
Web. doi:10.1063/1.4954231.
Cui, Shawn X., Email: xingshan@math.ucsb.edu, Quantum Architectures and Computation Group, Microsoft Research, Redmond, Washington 98052, Freedman, Michael H., Email: michaelf@microsoft.com, Microsoft Research, Station Q, University of California, Santa Barbara, California 93106, Sattath, Or, Email: sattath@gmail.com, Stong, Richard, Email: stong@ccrwest.org, & Minton, Greg, Email: gtminto@ccrwest.org. Quantum Maxflow/Mincut. United States. doi:10.1063/1.4954231.
Cui, Shawn X., Email: xingshan@math.ucsb.edu, Quantum Architectures and Computation Group, Microsoft Research, Redmond, Washington 98052, Freedman, Michael H., Email: michaelf@microsoft.com, Microsoft Research, Station Q, University of California, Santa Barbara, California 93106, Sattath, Or, Email: sattath@gmail.com, Stong, Richard, Email: stong@ccrwest.org, and Minton, Greg, Email: gtminto@ccrwest.org. 2016.
"Quantum Maxflow/Mincut". United States.
doi:10.1063/1.4954231.
@article{osti_22596848,
title = {Quantum Maxflow/Mincut},
author = {Cui, Shawn X., Email: xingshan@math.ucsb.edu and Quantum Architectures and Computation Group, Microsoft Research, Redmond, Washington 98052 and Freedman, Michael H., Email: michaelf@microsoft.com and Microsoft Research, Station Q, University of California, Santa Barbara, California 93106 and Sattath, Or, Email: sattath@gmail.com and Stong, Richard, Email: stong@ccrwest.org and Minton, Greg, Email: gtminto@ccrwest.org},
abstractNote = {The classical maxflow mincut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. By associating an integral capacity to each edge and a tensor to each vertex in a flow network, we can also interpret it as a tensor network and, more specifically, as a linear map from the input space to the output space. The quantum maxflow is defined to be the maximal rank of this linear map over all choices of tensors. The quantum mincut is defined to be the minimum product of the capacities of edges over all cuts of the tensor network. We show that unlike the classical case, the quantum maxflow=mincut conjecture is not true in general. Under certain conditions, e.g., when the capacity on each edge is some power of a fixed integer, the quantum maxflow is proved to equal the quantum mincut. However, concrete examples are also provided where the equality does not hold. We also found connections of quantum maxflow/mincut with entropy of entanglement and the quantum satisfiability problem. We speculate that the phenomena revealed may be of interest both in spin systems in condensed matter and in quantum gravity.},
doi = {10.1063/1.4954231},
journal = {Journal of Mathematical Physics},
number = 6,
volume = 57,
place = {United States},
year = 2016,
month = 6
}

Quantum nucleation of vortices in the flow of superfluid sup 4 He through an orifice
Flow measurements in ultrapure {sup 4}He through a micronsize orifice at millikelvin temperatures show, for the first time, the transition from thermal to quantum nucleation of nanometersize vortices below a crossover temperature of 0.147 K. These observations establish the close relationship between this type of critical flow and negativeion motion in superfluid {sup 4}He and strongly suggest that the underlying mechanism, the nucleation of vortex halfrings, is identical. 
Relativitic quantum flow and classical transport theory
The authors study the classical limit of the equal time relativistic quantum transport theory for spin {1/2} matter fields. Considering a systematic {h_bar} expansion they obtain the relativistic 3+3+1 dimensional phase space transport equations for the particle and antiparticle sector of the Hilbert space. These equations comprise the dynamics of flow and motion of spin and resemble in their structure the Vlasov and the phase space version of the Bargmann, Michel and Telegdi spin equation. 
Rapid and Sensitive Detection of Protein Biomarker Using a Portable Fluorescence Biosensor based on Quantum Dots and a Lateral Flow Test Strip
A portable fluorescence biosensor with rapid and ultrasensitive response for trace protein has been built up with quantum dots and lateral flow test strip. The superior signal brightness and high photostability of quantum dots are combined with the promising advantages of lateral flow test strip and resulted in high sensitivity, selectivity and speedy for protein detection. Nitrated ceruloplasmin, a significant biomarker for cardiovascular disease, lung cancer and stress response to smoking, was used as model protein to demonstrate the good performances of this proposed Qdotbased lateral flow test strip. Quantitative detection of nitrated ceruloplasmin was realized by recording the fluorescencemore » 
A flow cytometrybased dopamine transporter binding assay using antagonistconjugated quantum dots
Here we present the development and validation of a flow cytometrybased dopamine transporter (DAT) binding assay that uses antagonistconjugated quantum dots (QDs). Our anticipation is that our QDbased assay is of immediate value to the high throughput screening of novel DAT modulators.