Recent comments from SciRate

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)

That's correct. Thanks for spotting it ! The correct relation should be (1/|sigma_q|)sum_sigma = (1/(d-1))(dF-1). Another typo shows up in eq 41 which has essentially the same resolution. We'll correct this on the next update.

This is really a great work.. should be implemented with all the required resources.

Nice work~ Is there any typo on the formula (33)? It seems not consistent with former average fidelity formula...

Good job

You might be interested in this: https://cs.stanford.edu/people/karpathy/convnetjs/demo/image_regression.html

Good job... The dynamic reference frame is quite an interesting topic. Can be very helpful if used to full potential.

Liked the dynamic reference frame concept.

👍👍

Very helpful article. An ensemble of classification and time series technique. Concept of lead time is also interesting.

Is the implementation of the cQASM compiler open-source and if yes, where can I find the code?

"This is a very inspiring paper! The new framework (ZR = All Reality) it provided allows us to understand all kinds of different reality technologies (VR, AR, MR, XR etc) that are currently loosely connected to each other and has been confusing to many people. Instead of treating our perceived sens

...(continued)

The most important reading here is Sam Braunstein's foundational paper: https://authors.library.caltech.edu/3827/1/BRAprl98.pdf published in January 98, already containing the key results for the strong convergence of the CV protocol. This is a must-read for those interested in CV quantum informatio

...(continued)

One should also consult my paper "Strong and uniform convergence in the teleportation simulation of bosonic Gaussian channels" https://arxiv.org/abs/1712.00145v4 posted in January 2018, in this context. It is published in the June 2018 issue of Physical Review A and available at https://journals.aps

...(continued)

Some quick clarifications on the Braunstein-Kimble (BK) protocol for CV teleportation
and the associated teleportation simulation of bosonic channels.
(Disclaimer: the following is rather technical and CVs might not be so popular on this blog...so I guess this post will get a lot of dislikes :)

1)

...(continued)

[Fredrik Johansson][1] has pointed out to me (the author) the following about the multiplication benchmark w.r.t. GMP. This will be taken into account in the upcoming revision.

Fredrik Johansson wrote:
> You shouldn't be comparing your code to `mpn_mul`, because this function is not actually th

...(continued)

A very nice approach! Could you clarify the conclusion a little bit though? The aspirational goal for a quantum benchmark is to test how well we approximate a *specific* representation of a group (up to similarity transforms), whereas what your approach demonstrates is that without additional knowle

...(continued)

see my 2 papers on direction of vorticity (nov1996 + feb1999) = https://www.researchgate.net/profile/Philippe_Serfati (published author, see also mendeley, academia.edu, orcid etc)

see my 4 papers, 1998-1999, on contact and superposed vortex patches, cusps (and eg splashs), corners, generalized ones on lR^n and (ir/)regular ones =. http://www.researchgate.net/profile/Philippe_Serfati/ (published author).

Related Work:

- [Performance-Based Guidelines for Energy Efficient Mobile Applications](http://ieeexplore.ieee.org/document/7972717/)
- [Leafactor: Improving Energy Efficiency of Android Apps via Automatic Refactoring](http://ieeexplore.ieee.org/document/7972807/)

Comments are appreciated. Message me here or on twitter @moreisdifferent

Code is open source and available at :
[https://github.com/delton137/PIMD-F90][1]

[1]: https://github.com/delton137/PIMD-F90

Hello again Māris, many thanks for your patience. Your comments and questions have given me much food for thought, and scope for an amended version of the paper -- please see my responses below.

Please if any of the authors of [AST17 [arXiv:1712.01609](https://arxiv.org/abs/1712.01609)] have any fu

...(continued)