...(continued)In Appendix B there is a fragment:
> Consider a set of balls bouncing on
a billiard table [...] A moment of reflection
shows that entropy, so defined, generically increases from
$ t_a $ to $ t_b $ if it is defined by $ O_a $, but decreases if it is defined
by $ O_b $.I think that much cl
...(continued)Thank you for drawing my attention to this paper.
Having read through the paper I would say it is related to the work we reference and we will cite it in the next version of our manuscript. There are however a few differences.
Cabello's paper singles out the set of quantum correlations from the
...(continued)One small comment of a layman, you write:
> The Born rule has been derived within the framework of quantum logic, taking an operational approach, and using other methods. But all these derivations assume, among other things, the mathematical structure of quantum measurements, that is, the corresp
Anyhow, wouldn't be any theory or interpretation useless, ridiculous as a worldview, were such a basic assumption invalid?
...(continued)Thank you for your comment.
Yes, I agree that there is a prima facie incompatibility between the assumption that measurements have definite outcomes and the many worlds approach. Indeed I think that more generally there is a certain incompatibility between the operational approach to physical theor
...(continued)It is not clear that this result would apply to the many-worlds interpretation. The authors state their assumption "that there exist experiments which yield definite outcomes (possibly relative to a given agent who uses this formalism), and that it makes sense to assign probabilities to those outco
...(continued)Hi Ashley.
"Is there another ensemble of random graphs which would be a better test case, in the sense that the best known classical algorithms do badly (empirically or theoretically) at approximating the max-cut?"
-- I assume you're imagining cases that are not derived from NP-hardness? (I'm
...(continued)Is there another ensemble of random graphs which would be a better test case, in the sense that the best known classical algorithms do badly (empirically or theoretically) at approximating the max-cut?
"I don't think we will see QAOA for n = 10000." ... only if we never have a quantum computer wi
...(continued)I must admit that I don't see why this paper is convincing. The question is: Why did the author compare against the Goemans--Williamson algorithm (especially given that the test graphs were random G(n,1/2) graphs)?
1. It is well known that Goemans--Williamson performs poorly when the max-cut (no
...(continued)I like Sandu's provocation, but I don't think we need a new type of quantum state. We should not just consider Alice's description of the state and her memory, but should write a three party density matrix (Alice, Charlie, Spin). The tripartite density matrix is adequate for describing all experimen
These are precisely the kind of classical-quantum states everyone uses in quantum Shannon theory and they are equivalent to hybrid density operators.
...(continued)To echo the above comment by Pavel. If Alice prepares her system $S$ in the Z basis using an unbiased coin $C$ and forgets the outcome (but not the preparation basis) her state is:
$\rho^Z_{S,C} = \frac{1}{2} (|0\rangle \langle 0|_S \otimes |H \rangle \langle H|_C + |1\rangle \langle 1|_S \otimes
...(continued)To me, it seems that the authors don't like that the Heisenberg representation of a composed channel $\mathcal{E_1}\circ\mathcal{E}_2$ is given by $(\mathcal{E_1}\circ\mathcal{E}_2)^\dagger = \mathcal{E_2}^\dagger\circ\mathcal{E}_1^\dagger$ instead of $\mathcal{E_1}^\dagger\circ\mathcal{E}_2^\dagger
...(continued)This is not a resolution, just a possible refinement of the treatment.
It seems to me that Alice's choice of polarization axis should also be recorded in a separate notebook. The fact that Alice "remembers" the polarization axis after Charles stole the first notebook but does not "remember" the
...(continued)If I was Alice my state would be like
$$
\frac{1}{2} |\uparrow \rangle\langle \uparrow |\otimes \rho(\text{notebook that someone have stolen says up})
$$
$$ +\frac{1}{2} |\downarrow\rangle\langle \downarrow|\otimes \rho(\text{notebook that someone have stolen says down}),$$which encodes the pr
...(continued)I suspect that the object he's looking for is the hybrid density operator $\rho(x) = \rho_x P(x)$, where $\rho_x$ is the density operator conditioned on a classical variable being $x$ and $P(x)$ is the prior probability distribution of the random variable, so it incorporates both the method of prepa
...(continued)Corrected!
This was not a casual error on my part, by the way. I first heard of Ewin Tang through Scott Aaronson's blog post https://www.scottaaronson.com/blog/?p=3880. The post itself has no indication of Ewin's gender, but comment #6 refers to Ewin as a "he" and Scott's response (comment #7) do
*She: https://ewintang.com/ ("pronouns: she/her")
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!
...(continued)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
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.
...(continued)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
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."
...(continued)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.01122Proctor et al. [Phys. Rev. Lett.
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
...(continued)Sources:
- https://arxiv.org/pdf/1512.03385.pdf
- http://image-net.org/challenges/talks/ilsvrc2015_deep_residual_learning_kaiminghe.pdfSummary:
- 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
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?
...(continued)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
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.
...(continued)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
Braneshop, and
the US National Science Foundation.
SciRate