Recent comments from SciRate

Robin Blume-Kohout Nov 09 2021 01:27 UTC

It is worth noting that finding the MLE or Bayesian mean/MAP estimate of a d-dimensional quantum state is only hard when the candidate states are restricted to a nonconvex prior. Finding the most likely *pure* state is indeed hard for arbitrary measurement records, but the hardness goes away if you

...(continued)
Ludovico Lami Nov 06 2021 11:14 UTC

Yes, we deal with entanglement in the usual way, by assuming that the underlying Hilbert space is bipartite -- separable but possibly infinite dimensional. I'm not sure how to define the theory of entanglement manipulation, and in particular the problem we are tackling here, without these basic ingr

...(continued)
Zak Webb Nov 05 2021 17:24 UTC

Just wondering, it seems like this work deals with infinite Hilbert spaces by assuming that they have a tensor product structure. Have you thought about what would happen if instead the Hilbert spaces were communitive? I'm not too familiar with how entanglement in these systems work, but this seem

...(continued)
Bartosz Regula Nov 05 2021 13:22 UTC

Indeed, thanks for catching that!

Seok Hyung Lie Nov 05 2021 08:50 UTC

Great work! I think there is a typo; before Eq.(17), "||X_3||_1=2" should be "||X_3||_∞=2", I guess.

Christophe Vuillot Oct 28 2021 18:37 UTC

Unfortunately there is a problem with making boundaries this way. There are space-time constant-size logical errors. An updated version will appear soon.

Earl Campbell Oct 25 2021 18:29 UTC

Craig raises a good question. Measurement & feedback are really important. Although so far I am only familiar with a few examples (e.g. the 4T CCZ and friends) that were found by hand.

Currently, I think there is no general theory (not 1 paper that I know of) on how to formalize or solve the

...(continued)
Jerry Finkelstein Oct 24 2021 17:26 UTC

For the Pusey-Masanes experiment, one could consider the simple special case in which all measurement directions were the same (i.e., a1 = b1 = a2 = b2) . This special case does not lead to violation of the CHSH inequality, but is enough to reveal the conflict between results of Pusey-Masanes an

...(continued)
Priyanka Mukhopadhyay Oct 22 2021 15:55 UTC

The algorithm assumes the input is a n-qubit unitary and the output is a circuit with gates from a universal gate set consisting of Clifford+non-Clifford gates. It does not consider measurement or classical feedback in the generating set.

Craig Gidney Oct 22 2021 15:38 UTC

Does this algorithm consider circuits that use measurement and classical feedback? All the state of the art constructions make heavy use of that now. Eg. does the algorithm find the 4T CCZ, the 6T CCCZ, and the 4n+-O(1) 2s complement adder?

Blake Stacey Oct 20 2021 00:21 UTC

Regarding the conjecture from the old [samizdat](https://arxiv.org/abs/1405.2390): It wasn't directly about the number of free parameters needed to write a fiducial vector, but rather about the number of simultaneous equations that need to be solved. [Our 2017 review](https://arxiv.org/abs/1703.0790

...(continued)
Ruslan Shaydulin Oct 19 2021 15:32 UTC

This idea has been popping up in the literature quite a bit, mostly as a first step in some iteratively grown ansatz. See e.g. 2008.08615, 2009.10095 or 2102.05566

Disclaimer: I'm a co-author of the last paper

Xin Wang Oct 19 2021 10:52 UTC

Previous work 2101.07267 has already introduced the single-qubit rotation ansatz for MaxCut and presented its connection to continuous MaxCut, which delivers the hardness of VQA optimization. Moreover, 2105.01114 has done an extended study on this ansatz for MaxCut.

**Just to clarify:** I am not

...(continued)
Marco Cerezo Oct 18 2021 14:40 UTC

I believe that is correct.

Henrik Dreyer Oct 18 2021 07:13 UTC

Hi Xin! Just to check you don't need a quantum computer for this algorithm, right?

Sangchul Oh Oct 17 2021 04:52 UTC

Thank Sergio for your comments.

1. Google's output bit-strings have more 0 bits than 1, so do not pass the NIST random number tests (failure in frequency test, run test, template matching test, approximate entropy test, and cumulative sum test). In that sense, the word "Non-randomness" is used. If

...(continued)
Christopher Chubb Oct 14 2021 19:03 UTC

For anyone interested in playing around with tensor network decoding I recently released the TN contracting algorithm used as a stand-alone Julia package: [`SweepContractor.jl`][1]. Also [here][2] is a link my TQC talk on this work.

[1]: https://github.com/chubbc/SweepContractor.jl
[2]: h

...(continued)
Sergio Boixo Oct 13 2021 17:59 UTC

It is wrong to write that the Google experiment has “Non-Randomness”. What this paper says is that the experiment is not perfect, but that is not a requirement for the claim of beyond classical computation. Similar differences from the perfect distribution are documented in our paper, for instance F

...(continued)
Blake Stacey Oct 11 2021 19:04 UTC

Perhaps it is worth elaborating upon this topic a little more. Here is what Di Biagio and Rovelli call a "proper reformulation" of Pienaar's fifth premise:

> **An interaction between two systems results in a correlation within the interactions
between these two systems and a third one.** With r

...(continued)
Blake Stacey Oct 09 2021 19:33 UTC

I had hoped this would clarify things, but after reading it, I'm more confused about what RQM is supposed to be than ever before. Part of the trouble is passages that I just can't parse, like their replacement for Pienaar's fifth premise (it's important enough to be in bold):

> An interaction betwe

...(continued)
Victory Omole Oct 06 2021 19:54 UTC

The URL in citation [47] should be https://github.com/sflammia/ACES.

Blake Stacey Oct 06 2021 18:19 UTC

It's been [a good couple weeks](https://scirate.com/arxiv/2109.13018) for the Hoggar SIC!

Sebastian Pliet Oct 04 2021 15:42 UTC

Roberts' claims are in conflict with:

Shankland et al. (1955): https://doi.org/10.1103/RevModPhys.27.167
In their statistical analysis, they find a signal.

Consoli et al. (2013): https://arxiv.org/abs/1302.3508
They point out an error in a method Roberts used.

Pliet (2021): https://doi.or

...(continued)
Matt Hastings Sep 29 2021 15:07 UTC

Thanks for the comment Thomas! I must apologize, a few important words "X-type" and "Z-type" were missing. I have updated the draft, hopefully it is more clear now.

Blake Stacey Sep 24 2021 17:08 UTC

I've gotten much more feedback than I expected, so a v2 of this is in preparation.

Kunal Marwaha Sep 24 2021 02:35 UTC

Here's a short summary of the main points: https://arxiv.wiki/abs/2109.10833

Mark Steudtner Sep 17 2021 16:11 UTC

Dear authors,
how does this paper relate to the results of Ouyang et al.:
https://arxiv.org/abs/1910.06255 ?

Ruslan Shaydulin Sep 08 2021 02:48 UTC

An implementation of this algorithm is now available here:
https://github.com/QAOAKit/QAOAKit

Example use: https://github.com/QAOAKit/QAOAKit/blob/master/examples/classical_algorithms_vs_qaoa.py

Ruslan Shaydulin Sep 03 2021 14:06 UTC

This dataset is now available as a pandas DataFrame here: https://github.com/QAOAKit/QAOAKit

Example use: https://github.com/QAOAKit/QAOAKit/blob/master/examples/Tackling%20open%20problems.ipynb

Ruslan Shaydulin Sep 03 2021 14:05 UTC

This dataset is now available as a pandas DataFrame here:
https://github.com/QAOAKit/QAOAKit

Example use:
https://github.com/QAOAKit/QAOAKit/blob/master/examples/Transferability%20to%20unseen%20instances.ipynb

Kunal Marwaha Sep 02 2021 09:46 UTC

I wrote a short summary on the arXiv wiki: https://arxiv.wiki/abs/2108.12477

Victory Omole Aug 31 2021 16:11 UTC

Thank you very much for posting the code that goes along with this paper. In your "Code and Data" section, you link to https://github.com/LBNL-HEP-QIS/activereadouterrors when it should be https://github.com/LBNL-HEP-QIS/ReadoutErrors.

Markus Heinrich Aug 13 2021 08:10 UTC

Indeed, thanks for clarifying this. Going a bit off-topic, let me briefly summarise the important points: Being a group is very restrictive for a unitary design, as e.g. there is a only one finite group $t$-design for $t\geq 4$ which is in dimension $d=2$ for $t=5$. For quantum info purposes, even $

...(continued)
Christian Majenz Aug 13 2021 06:36 UTC

Thanks, Markus, for spreading the word about the Bannai et al. paper (I was very surprised by it when it was brought to my attention by Jonas Helsen). Just in case somebody reads this without having a look at one of the papers afterwards: Bannai et al. enumerate all t-designs **that are also finite

...(continued)
Joel Wallman Aug 11 2021 18:14 UTC

Dear Markus,

Thank you for alerting us to Banai's work and your translation of the key implications for quantum information. We will modify the "folklore" statement in the introduction and add a statement that we provide an explicit, self-contained, and intuitive proof, which is useful because th

...(continued)
Markus Heinrich Aug 11 2021 07:48 UTC

As the authors point out, there is indeed some confusion in the community about why the distinction between prime and non-prime dimension is important when dealing with the Clifford group (and, in fact, the stabiliser formalism overall). In fact, one has to be very careful when dealing with the non-

...(continued)
Andrew Guo Jul 27 2021 23:57 UTC

Intriguing result! I'm curious as to the hint in the outline of the paper at the existence of a conclusion with "open research problems," but I can't seem to find it. Did it perhaps get left out? Or maybe the open questions got resolved by the final draft? :)

Jacques Pienaar Jul 21 2021 15:17 UTC

Hi Wojciech! Thanks for the thoughtful comments.

I think both of the points you raise are valid. Regarding the first point, it might indeed be possible to escape my trilemma in IVC using an argument along the lines of the one you suggest. However, it raises the question of what it means to say "t

...(continued)
Edward H Chen Jul 20 2021 20:27 UTC

https://journals.aps.org/prapplied/abstract/10.1103/PhysRevApplied.15.044033

Andrea Mari Jul 19 2021 12:19 UTC

Hi Igor,

I am not sure you or your coauthors will read this message. Anyway, very nice work!

I think I agree with all your arguments and your way of reasoning. In fact, considering also the thesis of Baym and Ozawa [10], we also did not claim that the Gedankenexperiment in our work [9] was a

...(continued)
Noon van der Silk Jul 19 2021 10:24 UTC

Probably just a bug.

En Jui Chang Jul 19 2021 02:06 UTC

Published 01 Apr 2021

Siddhartha Das Jul 15 2021 13:07 UTC

This work is now published. https://iopscience.iop.org/article/10.1088/1367-2630/ac0755

James D. Watson Jul 14 2021 10:27 UTC

Just before posting we realised Sandy Irani and Dorit Aharonov found similar results to ours independently. Their work is posted simultaneously here: https://scirate.com/arxiv/2107.06201

Andreas Bluhm Jul 13 2021 15:35 UTC

There is a new version of this work in which we consider, additionally to the routing protocol, a BB84-like single qubit protocol for position verification and prove that it is secure under the same conditions as the routing protocol (Section 4). Both protocols have their pros and cons regarding app

...(continued)
Wojciech Kryszak Jul 10 2021 23:21 UTC

Dear Jacques,

It is - as usually - a huge and tasty piece of food for thought! As for now I have 2 comments I dare to leave here:

First, the line of reasoning from IVC seems misleading - or rather, it is not a dead-end corridor as you seem to picture it. Let me recapitulate IVC in the light o

...(continued)
Wojciech Kryszak Jul 09 2021 19:40 UTC

You have done some actions - and those had to be done *by yourself* - so now sth exists. Could this meet ,,one of the common [sic] definitions of solipsism''?

BTW, what if such things with arXiv are not just some trivial arXiv-engine bugs but a kind of truly profound glitches? Perhaps a sign that

...(continued)
S A Smith Jul 09 2021 12:28 UTC

No, it'll surely fail to spot it. It isn't even capable to consistently spot arxiv citations in bibliographies. For instance, [arXiv:2006.02790][1] had cited [arXiv:1810.13401][2] and [arXiv:1912.07554][3] but Google Scholar didn't spot that.

[1]: https://arxiv.org/abs/2006.02790
[2]: http

...(continued)
Blake Stacey Jul 09 2021 05:37 UTC

This will be an interesting test case for Google Scholar: Will it be clever enough to spot the pointer to [arXiv:2107.00670](https://scirate.com/arxiv/2107.00670) that is given in the text but not the bibliography?

Terry Rudolph Jul 08 2021 21:43 UTC

Well, regarding the possibility we have become smarter I have plenty of evidence to the contrary (for both of us!)

Whats going on in terms of the explicit constructions we use is simple enough I'm reasonably sure its correct. But when I think of viewing this kind of computation from 30000 feet

...(continued)