Now at #PQC, Nicolas Didier from @rigetti on full stack quantum computing with superconducting qubits

#PQC #LTQI

#PQC #LTQI

Now at #IWQNS, Kavan Modi from @MonashUni on Stochastic proceses and application to quantum networks

#LTQI

#LTQI

@MonashUni Kavan Modi: Classical stochastic processes can ofte be modelled by MArkov Chains, ore hidden markov chains, where the last n responses (n:= Markov order) are lumped together. #LTQI #IWQNS

@MonashUni Kavan Modi: What happens on quantum systems ? Like Biomolecule hit by a stream of laser pulses, or qubit modified by gates in presence of correlated environment. #LTQI #IWQNS

Now at #IWQNS Zhang Zheshen form @UoA on Entanglement-Assisted Quantum Photonic Sensor Networks

#LTQI

#LTQI

@uoa Zhang Zheshen uses enatgled light to detect targets. His entaglement source, low brightness limit: # photon/mode N_s ≫ 1. Phase correlation |⟨â_s â_I⟩|≈√N_S ≫ N_S. #LTQI #IWQNS

@uoa Zheshen Zhang:

In an experiment with 14 dB loss, 75 dB Nouise background, quantum wins by 1 dB

arxiv:1411.5969 arxiv.org/abs/1411.5969 PRL 114 110506 doi.org/10.1103/PhysRe…

Ideal implementation would be 3 dB

Quantum bound is 6 dB (matched by explicit receiver)

#IWQNS #LTQI

In an experiment with 14 dB loss, 75 dB Nouise background, quantum wins by 1 dB

arxiv:1411.5969 arxiv.org/abs/1411.5969 PRL 114 110506 doi.org/10.1103/PhysRe…

Ideal implementation would be 3 dB

Quantum bound is 6 dB (matched by explicit receiver)

#IWQNS #LTQI

Now at #IWQNS, Kanupriya Sinha from @ArmyResearchLab and @JQInews on Tailoring fluctuation phenomena in nanophotonic systems: collective effects in Casimir-Polder forces & non-Markovian dynamics in atomic collective states

#LTQI

#LTQI

@ArmyResearchLab @JQInews Kanupriya Sinha; Casimir–Polder forces are important for integrated atom systems.

The interaction of a dipole at distance z of a mirror is U ∼ – ℏΓ₀/16(k₀z)³ : At z∼10 nm, U∼10 mK.

Where k₀ ← ω₀ (2 level split)

#LTQI #IWQNS

The interaction of a dipole at distance z of a mirror is U ∼ – ℏΓ₀/16(k₀z)³ : At z∼10 nm, U∼10 mK.

Where k₀ ← ω₀ (2 level split)

#LTQI #IWQNS

@Berkeley_ions Sara Mouradian did her PhD on NV centers, and now works on ion traps.

A single photon detected from two NV⁻ centers allows to prepare them in entangled state. Her NV's are at 10K. Current rate of entanglement is limite to much less than spin coherence time

#LTQI #IWQNS

A single photon detected from two NV⁻ centers allows to prepare them in entangled state. Her NV's are at 10K. Current rate of entanglement is limite to much less than spin coherence time

#LTQI #IWQNS

@Berkeley_ions Sara Mouradian put her NVs in photonic crystal (diamond) cavities to improve entanglement rate. Her cavity has Q>14,000, but NVs are then close to surfaces, which broadens noise.

#LTQI #IWQNS

#LTQI #IWQNS

Now at #IWQNS, Ashlesha Patil, Saikat’s student at @UoA speaks on Classical Simulation of Stabilizer Circuits

#LTQI #IWQNS

#LTQI #IWQNS

Now at #IWQNS, Saikat Guha from @UoA on photonic quantum computing with discrete variable cluster states

#LTQI

#LTQI

Now at #IWQNS, Rafael N. Alexander from @UNM on quantum computing with continuous variable clusters

#LTQI

#LTQI

Now ar #IWQNS Lincoln D. Carr @coschoolofmines on quantifying complexity in quantum phase transitions via mutual information complex networks

#LTQI

#LTQI

@coschoolofmines Lincoln D. Carr: In present quantum device (@dwavesys and analog devices) can already be described by networks difficult to simulate. Networks can be in the Hamiltonian, or arise spontaneously in the state. Here is about these spontaneous networks

#LTQI #IWQNS

#LTQI #IWQNS

Now at #IWQNS, @vparigi81 from @lkb_lab on Engineering non-Gaussian entangled complex photonic graph states .

#LTQI

#LTQI

@vparigi81 @lkb_lab Recent #LTQI threads from me on simlar talks by @vparigi81 :

https://twitter.com/fgrosshans/status/1098964327548272640,and

https://twitter.com/fgrosshans/status/996325413273120770(includes link to a video)

@vparigi81 @lkb_lab .@vparigi81’s networks’ nodes are frequency/temporal modes of e.m. fields, made thorugh quantum frequency combs. That is merging optical frequency combs (OFC), with 10⁶ modes with quantum optics by pumping a parametric oscilaltorwith an OFC #LTQI #IWQNS

Now at #IWQNS @SumeetKatri6

from @LSU on Robust NEtwork Architectures and topologies for entanglement distibution #LTQI #IWQNS

from @LSU on Robust NEtwork Architectures and topologies for entanglement distibution #LTQI #IWQNS

@LSU @SumeetKhatri6 .@SumeetKhatri6 : looks at 2D networks without quantum repeaters, using the multiplicity of paths to add robustness to losses and node failure.

#IWQNS #LTQI

#IWQNS #LTQI

Now at #IWQNS, Don Towsley from @UMassAmherst on Entanglement routing and switching in quantum networks #LTQI

@UMassAmherst Don Towsley looks at repeaters/routers/switchs

With m links/link

Phase 1: link entanglement succeeds with p=1 – (1 — p₀)^m

Phase 2: splicing the links succeeds with probability q

#LTQI #IWQNS

With m links/link

Phase 1: link entanglement succeeds with p=1 – (1 — p₀)^m

Phase 2: splicing the links succeeds with probability q

#LTQI #IWQNS

@UMassAmherst Don Towsley study this in a grid network, with a single mode per link, one memory/mode, and a probability p to generate entanglement. #LTQI #IWQNS

Now at #IWQNS, Prithwish Basu from U. Massachusetts on Routing and Scheduling in cClassiacal Networks #LTQI

Now at #IWQNS, Roberta Zambrini, from @IFISC_mallorca on Quantum complex networks: introduction, Synchronization ans Noiseless subspaces #LTQI

@IFISC_mallorca Roberta Zambrini: classical complex networks are used to study the phenomenon of spontaneous synchronization. It has been recently generalized into the quantum regime

#LTQI #IWQNS

#LTQI #IWQNS

@IFISC_mallorca Roberta Zambini: The synchronization is induced by a dissipation. Two coupled squeezed harmonic oscillators need collective dissipation to become synchronized. (independent dissipation doesn’t lead to sync)

#IWQNS #LTQI

#IWQNS #LTQI

Now at #IWQNS, Patrick Thiran from @EPFL presents an overview of classical an and complex networks. Mainly on classical networks, and on tools who might be applied to quantum networks.

#LTQI

#LTQI

Now at #QICA, Damian Markham from @ScienceSorbonne presents an Introduction to Quantum Networks

#LTQI

#LTQI

@ScienceSorbonne Damian Markham’s talk is actually steamed here facebook.com/watchparty/624…

Damian Markham recalls the advantages we expect from quantum information, in computation, simulation, communication, and sensing. #LTQI

Seated for a talk by Mio Murao, form @UTokyo_News_en on Higher order quantum operations of blackbox unitaries and causal structure of the blackboxes. #LTQI

@UTokyo_News_en Mio Murao ([村尾 美緒) uses quantum computer to understand physics. What we can do do and what we cannot do are physics problems.

#LTQI

#LTQI

@UTokyo_News_en Mio Murao ([村尾 美緒) more specificely looks at maps of maps: The computer F takes as input a map f (e.g. given as a black box) and a quanutm state ρ and outputs F(f)(ρ).

Here we restrict ourseves to unitary f=U, and F(U)=V also unitary.

#LTQI

Here we restrict ourseves to unitary f=U, and F(U)=V also unitary.

#LTQI

Seated for a seminar on “Quantum Information Technology for Network”, by Qin Hai, from CAS Quantum Network Co., ltd, in Shanghai. This talk will essentially be focused on Chinese progress

#LTQI

#LTQI

Qin Hao: The chinese quantum satellite Micius has 3 mission. 1/ Act as a trusted quantum node, with QKD rate of 1 kbps (recently 400 kbps) ; 2/ Distribute entanglement between 1200km distant locations; 3/ Groud to satellite quantum state teloprtation

#LTQI

#LTQI

Qin Hao: The goal of the Chines Beijing–Shanghai 2000km QKD backbone is to have actual users. A next step (underway) is extend the backbone across China. And beyond, using satellites

#LTQI

#LTQI

Seated for a talk by Mathieu Bozzio, on "Towards trusting your local Franprix's payment terminal..." a.k.a. “Money money money, must be funny, in a quantum world !”.

Joint work with Eleni Diamanti and myself, arXiv:1812.09256 arxiv.org/abs/1812.09256

#LTQI

Joint work with Eleni Diamanti and myself, arXiv:1812.09256 arxiv.org/abs/1812.09256

#LTQI

Mathieu Bozzio: in the 1970s, Stephen Wiesner invented a quantum banknotes scheme, with security based on the no-cloning theorem.

Mint→Client→Bank

For quantum credit cards, there is classical communication between the Merchant and Bank:

Mint→Client→Merchant→Bank

#LTQI

Mint→Client→Bank

For quantum credit cards, there is classical communication between the Merchant and Bank:

Mint→Client→Merchant→Bank

#LTQI

Mathieu Bozzio’s approach : the attack cooresponds ti minimizing losses & error using convex optimization. To be practical, we use coherent states, with the following mapping

|0⟩→|α⟩⊗|vac⟩ ; |1⟩→|vac⟩⊗|α⟩

|±⟩→|α/√2⟩⊗|±α/√2⟩

|±i⟩→|α/√2⟩⊗|±iα/√2⟩

#LTQI

|0⟩→|α⟩⊗|vac⟩ ; |1⟩→|vac⟩⊗|α⟩

|±⟩→|α/√2⟩⊗|±α/√2⟩

|±i⟩→|α/√2⟩⊗|±iα/√2⟩

#LTQI

Now seated for a seminar by Antoine Grospellier, from @inria_paris, on Constant overhead quantum fault-tolerance with quantum expander codes.

Associated paper: arXiv:1808.03821 arxiv.org/abs/1808.03821

#LTQI

Associated paper: arXiv:1808.03821 arxiv.org/abs/1808.03821

#LTQI

@inria_paris Antoine Gropellier recalls the principle of quantum fault tolerance with concateneated Steane codes. Without correction, with error probability p, a circuit C, |C| gates and m qubits, Pr(wrong output)≤p|C|,

With code, 7m qubits, ≤c₀|C| gates, Pr(wrong)≤cp²|C|

#LTQI

With code, 7m qubits, ≤c₀|C| gates, Pr(wrong)≤cp²|C|

#LTQI

@inria_paris Antoine Grospellier: with n iteration, 7ⁿm qubits, ≤c₀ⁿ|C| gates, Pr(Wrong)≤|C| (cp)^2ⁿ /c

This doubly exponenetial scaling of the error translates into a polylog(ε) scaling of the space overhead with the errors.

Ou main interest here is thii overhead

#LTQI

This doubly exponenetial scaling of the error translates into a polylog(ε) scaling of the space overhead with the errors.

Ou main interest here is thii overhead

#LTQI

Seated for a seminar by Francesco Arzani on his work with Nicolas Treps and Giulia Ferrini on

Polynomial approximation of non-Gaussian unitaries by counting one photon at a time (arXiv:/1703.06693 arxiv.org/abs/1703.06693 / PRA 95 052352 dx.doi.org/10.1103/PhysRe… )

#LTQI

Polynomial approximation of non-Gaussian unitaries by counting one photon at a time (arXiv:/1703.06693 arxiv.org/abs/1703.06693 / PRA 95 052352 dx.doi.org/10.1103/PhysRe… )

#LTQI

Francesco Arzani: It’s difficult to define computation in a continuous variable (CV) set-up. People usually chose specific encoding of qubits. But Francesco (and myself!) finds encoding independent definitions more interesting.

#LTQI

#LTQI

Francesco Arzani: we are interested in the transformation exp(i H(q,p)).

A universal state should be bale to approximate any polynomial hamiltonian. arXiv:quant-ph/9810082 arxiv.org/abs/quant-ph/9… / PRL 82 1784 doi.org/10.1103/PhysRe… gave an example with quadratic gates + 1 cubic

A universal state should be bale to approximate any polynomial hamiltonian. arXiv:quant-ph/9810082 arxiv.org/abs/quant-ph/9… / PRL 82 1784 doi.org/10.1103/PhysRe… gave an example with quadratic gates + 1 cubic

Seth Lloyd from @MIT is visiting us at LIP6 and presents his work with András Gilyén (from @QuSoftAmsterdam ) and @ewintang (from @UW) on Quantum-inspired low-rank stochastic regression with logarithmic dependence on the dimension arXiv:1811.04909 arxiv.org/abs/1811.04909

#LTQI

#LTQI

@MIT @QuSoftAmsterdam @ewintang @UW Seth Lloyd: presents the recommendation problem. For m users, n movies, a n×m matrix A encodes the movie preferences. The goal is to recommend movies a user likes, given their previous preferences.

A is assumed to be low rank (the rank is the effective number of genres).

#LTQI

A is assumed to be low rank (the rank is the effective number of genres).

#LTQI

@MIT @QuSoftAmsterdam @ewintang @UW Seth Lloyd: The @netflix way to solve this problem is through singular value decomposition of matrix A.

A=∑_l σ_l U^l V^l ^T

σ_l: singular values

U^l and V^l are left/right singular vectors

A V^l= σ_l U^l V^l

In short V^l^T b = p_l encodes weighted preference for genre l

#LTQI

A=∑_l σ_l U^l V^l ^T

σ_l: singular values

U^l and V^l are left/right singular vectors

A V^l= σ_l U^l V^l

In short V^l^T b = p_l encodes weighted preference for genre l

#LTQI

Seated for Niraj Kumar PhD defense, on Design, analysis and implementation of advanced quantum communication protocols

#LTQI

#LTQI

Niraj Kumar introduces the Simultaneous Message PAssing Model (SMP) (i.e. with a referee) to solve the Euclidean distance.

Classical complexity= Ω(√n)

Quantum Complexity=O(log n)

The quantum algorithm uses C-Swap to sample ½(1- |⟨x|y⟩|²

#LTQI

Classical complexity= Ω(√n)

Quantum Complexity=O(log n)

The quantum algorithm uses C-Swap to sample ½(1- |⟨x|y⟩|²

#LTQI

@cvxr There is a bug on your webpage cvxr.com/cvx/citing/ : the url of ref [2] does not exist ( stanford.edu/~boyd/graph_dc… ), but replacing .html by .pdf leads to a correct document ( web.stanford.edu/~boyd/papers/p… )

Actually, the error is a missing /papers/ : web.stanford.edu/~boyd/papers/g…

and, to be complete, I think you should add the following line with the DOI to your bibtex

doi = {10.1007/978-1-84800-155-8_7},

doi = {10.1007/978-1-84800-155-8_7},

Support us! We are indie developers!

This site is made by just two indie developers on a laptop doing marketing, support and development! Read more about the story.

**Become a Premium Member** ($3.00/month or $30.00/year) and get exclusive features!

Too expensive? **Make a small donation** by buying us coffee ($5) or help with server cost ($10)

Thank you for your support!