Recent comments from SciRate

And she did!

This made me laugh more than any other SciRate post. Well done.

Ewin Tang, do your job! :-D

The arXiv isn't automatically generating a pdf for this paper, at least right now. Downloading the PostScript and using `ps2pdf` seems to work, though.

> I have to compile it from the source as arXiv says "Our automated source to PDF conversion system has failed to produce PDF for the paper: 1811.02192."

You needn't have it done, as there is the arxiv-vanity version (link above) as well!

Interesting work! But I have to compile it from the source as arXiv says "Our automated source to PDF conversion system has failed to produce PDF for the paper: 1811.02192."

Also I wonder how this is different from conventional stellar interferometry; see, e.g., https://en.wikipedia.org/wiki/Astr

...(continued)

This is an interesting result. I agree well-enough that here so-called "silly rules" can be used as a way to discover who the punishers are. But this doesn't really agree well with society, when we typically always know who the punishers are?

Seems like you don't even need silly rules anyway; this

...(continued)

Most definitely not the first fully quantum optimizer for neural networks
https://arxiv.org/abs/1806.09729

In App. A the 8th point should start $a|_{x} \propto b.$

The full line then reads:

$a|_{x} \propto b$ if $a = b \otimes c$ is a Pauli operator on a system $x \otimes y$

Some parentheses seem to be missing in the equations.

The sample complexities are

$$O\left(\frac{\log|C| + \log(1/ \delta)} { \epsilon^2}\right)$$

for pure states and

$$O\left(\frac{\log^3 |C|(\log |C|+\log(1/ \delta))} { \epsilon^2}\right)$$

for mixed states.

Impressed at the speed with which you read up to page 54. I think there's still two pixels space left at the right margin :-)

Interesting paper, but the equation formatting on p. 54 is quite daring.

Theorem 3.7 seems to be off. The Gottesman-Knill theorem allows the efficient simulation of Clifford circuits when the initial state is in the stabilizer polytope (assuming one can sample from arbitrary convex combinations of stabilizers efficiently). It is not a statement about entanglement being n

...(continued)

The question of whether oracle access to $U$ is polynomially-equivalent to oracle access to $U$ and $U^{-1}$ is important in the context of *quantum oracle separations.* See page 4 of *[Quantum Versus Classical Proofs and Advice](https://scirate.com/arxiv/quant-ph/0604056)*.

But in that context,

...(continued)

Hello,

Thank you, it is a pleasure to read, especially those reminiscences at the end.

Where would we stand, were it not for his shoulders!

One comment, describing the problems (of those times) with Wheler-Feynman electrodynamics, you write: ,,spontaneous emission of a photon from an atom

...(continued)

Just to add the the arxiv comment - this is a major update to the work. We have toned down the wording and added more graph invariants as well as a scheme for calculating more. We have attempted to address all issues raised here and in email correspondence.

Dave and Simone - thank you for your he

...(continued)

For those of you who wonder why this doesn't break fault tolerance: "The result here is actually consistent with the threshold theorem: it shows generic quantum circuits (except for a η-small subset) are classically simulatable under a constant level of error rate per physical gate."

The examples in this paper are not original and are now well understood. More importantly, the conclusions the paper draws are misleading as these issues have been fully resolved in these two papers:
https://arxiv.org/abs/1703.09835
https://arxiv.org/abs/1804.01122

Proctor et al. [Phys. Rev. Lett.

...(continued)

Links:

- Understanding the backward pass through Batch Normalization Layer https://kratzert.github.io/2016/02/12/understanding-the-gradient-flow-through-the-batch-normalization-layer.html
- https://www.quora.com/Why-does-batch-normalization-help

Sources:

- https://arxiv.org/pdf/1512.03385.pdf
- http://image-net.org/challenges/talks/ilsvrc2015_deep_residual_learning_kaiminghe.pdf

Summary:

- Took the first place in Imagenet 5 main tracks
- Revolution of depth: GoogLeNet was 22 layers with 6.7 top-5 error,
Resnet is 152 layers wit

...(continued)

- Implementations:
- https://hub.docker.com/r/mklinov/caffe-flownet2/
- https://github.com/lmb-freiburg/flownet2-docker
- https://github.com/lmb-freiburg/flownet2
- Explanations:
- A Brief Review of FlowNet - not a clear explanation
https://medium.com/towards-data-scien

...(continued)

It's like mask rcnn but for salient instances.
code will be available at https://github.com/RuochenFan/S4Net.

They invented a layer "mask pooling" that they claim is better than ROI pooling and ROI align.

>As can be seen, our proposed
binary RoIMasking and ternary RoIMasking both outperform

...(continued)

wonderful work！

I think the supplemental material is the appendices at the back of the paper. Those seem to contain everything the authors refer to.

Reference 22 says there's some supplemental material, is this material on the arXiv, or is it just the supplemental material in the back of the paper?

My overall impression about this survey is that its author has learned the material very recently and written this survey to summarize what he has learned. This is not an issue by itself, however it comes with several significant shortcomings.

First, the author is not familiar with (or for some r

...(continued)

Were the Lord to be *boshaft* (in spite of all these evidences), He would need to hide his contrivances really deep in the past - so it seems.

I also wanted to add one more comment about how our speedup can be implemented just using few-body interactions. It is possible to take time-dependant Hamiltonians with few-body interactions (and say, strong coupling) and construct a time-ordered unitary operator that implements the construction sug

...(continued)

Thank you for your interest in our paper. That is a really good question. Let me start by acknowledging that constructing higher-order Hamiltonians is currently hard in practice. Our result also applies when one restricts oneself to k-local Hamiltonians, in which case one obtains a speed increase th

...(continued)

@Carlos Perez-Delgado, thanks for answering questions here!
I am also confused when it comes to `trading locality' as Stuart suggests. Perhaps the right question to ask is:

> How would you construct the Hamiltonian $H_\text{#}(m) = \bigotimes_m H$ of
> equation (16) in a lab, for large $m$?

To my

...(continued)

This is a good question and it is worth clearing this up.

> Isn't this paper just proposing to trade circuit size for locality,
> e.g. replace k-many 1-local gates with a single k-local gate?

This part is essentially true. We are using non-locality as you call it (you can also say quantum correlat

...(continued)

Isn't this paper just proposing to trade circuit size for locality, e.g. replace k-many 1-local gates with a single k-local gate? Then changing the computational model to not count the cost of implementing the required k-local gates (which typically is ~k) to claim a 1/k speedup ?

Your SciNet for the current Solar System problem settles nicely in the mode of operation that is equivalent to the ,,stadard'' Heliocentric model wih positions encoded by Sun-angles relative to the fixed-stars background.

It would be very interesting to see what your SciNet would do when:

1. t

...(continued)

The browser cache strikes again! :-)

Oops, I had to Shift+F5 https://arxiv.org/abs/1807.05877 in order to force my browser to ignore the cache. I also see underscores on both pages now.

When I go to https://arxiv.org/abs/1807.05877, I see an "ancillary files" list on the sidebar, in which the files are listed with underscores. Clicking them opens text files with some lovely parabolas of plus and minus signs. Going to https://arxiv.org/abs/1807.05877v1, I get exactly the same thing.

The files still contain equal signs at https://arxiv.org/abs/1807.05877, and so they fail to open. But the files contain underscores instead at https://arxiv.org/abs/1807.05877v1, so they do open. Note v1 is the only version of the paper. Definitely an arXiv bug.

Your ,,comment'' is for me the most lucid explanation of the widely known (but - it seems - not seriously taken) fact that we can save locality at the cost of einsteinian (subject independent) reality.

The way it can work is immediately aprehensible once one relizes that Alice can get to know abo

...(continued)

It looks like the ancillary files have been renamed; they're accessible now.

Thanks, I will e-mail them. I posted this just to let people know that you can still access the files by other means. (The author could also solve the problem by just renaming them.)

Thanks for pointing this out! Did you let the arXiv maintainers (help@arxiv.org) know about this bug? If not, I can email them and credit you.

Seems like arXiv doesn't like ancillary files whose filename contains "=" (only the last link on [this page][1] works). But you can always download the [entire source package][2] in a single file.

[1]: https://arxiv.org/src/1807.05877v1/anc
[2]: https://arxiv.org/src/1807.05877v1

Thanks for reading the paper! I might have been able to include a couple extra steps in the derivation, but I didn't want this equation to take up too much space.

The basic idea is to expand the permutation operator $W_{1,2,3}$ as in equation (9), and then use the cyclic property of the trace op

...(continued)

Hi, thank you for the nice paper! Could you clarify the second and third equalities in eqn. (11)? Particularly, I am not sure how the tensor products vanished and also why the new subscripts are in the order 1,3,2 rather than a cyclic shift of 1,2,3 as suggested by the notation (123). Have you writt

...(continued)

Thank you very much for the clarification!

Thank you very much for your comment.

I'm sorry not to know the result.
However, it seems to us that the old proof does not work well,
or too ambiguous

In p.98, ' $\alpha |0\rangle|\psi_0\rangle+\beta|1\rangle|\psi_1\rangle$' is used,
but to apply Aaronson's technique, what we need is
'$\alph

...(continued)

The main result of this paper has already been shown previously in [Salman Beigi's PhD thesis (2009)][1] (Appendix B, Theorem B.0.5, p.98).

[1]: https://dspace.mit.edu/handle/1721.1/50594

Wow, this must be a breakthrough! So many people joining SciRate just to upvote it! Also, very creative user names:
[BladeMaster][1],
[KameBrown][2],
[siche][3],
[skyler][4],
[snow][5],
[zy z][6].
Will Blade Runner and Queen Elsa from Frozen also be joining to upvote this?

**Update:** Looks like [B

...(continued)

The group that we call "R(2)" in the paper, the "Realizable Group" is indeed generated by the physical unitaries in the left side of the table on page 2. This group, as a unitary matrix group, has 4,608 elements. However, the action on just the logical space is smaller, and there is a 4-to-1 homomor

...(continued)

Thank you for this timely work explaining standard tests run on the IBM machine!

Could you clarify what you refer to as the Realizable Group in the paper? Is it generated by the gates in the "Logical Equivalent" column in the table on page 2? This seems to correlate well with the statements in t

...(continued)