Recent comments from SciRate

This is an outstanding paper in quantum Shannon theory. Congratulations to the author.

Thanks for pointing this out! The PDF should be working now. Sorry about the initial error.

The arXiv vanity version seems to work (to some extent): https://www.arxiv-vanity.com/papers/2207.14438/

Looks like arXiv is not able to produce the PDF file for this paper.

Very interesting!

It seems that our future AI overlords will have us all speaking Pirahã, then. :)

Very nice paper. You may be interested in this great paper by Montina:
https://arxiv.org/abs/1107.4647
that looks into the d>2 case that you mention in your discussion section. It seems this qubit case is quite exceptional and difficult to generalize.

Thanks Mark! I'm also looking forward to read your paper in detail.

Thanks a lot for your comment and for pointing out your paper. We'll definitely add a citation to your work in a revision of our paper. We're reading your paper now and will email you if we have any questions about it.

Congratulations for the nice result! I did not expect that estimation of multivariate trances (also known as Bargmann invariants) can be performed so easily. Still, I wanted to point out that in this earlier work https://scirate.com/arxiv/2109.10006 with Ernesto Galvao and Dan Brod we managed to co

...(continued)

Hi William, Thanks for pointing out the error. Indeed, it should be

..., then $|{H_{ji}}|^2 = \sum_{kk'}h_kh_{k'}p_{kk'}^i(j)$ with $p_{kk'}^i(j)=\mathrm{Re}\langle i|U^\dagger P_k U\Pi_jU^\dagger P_{k'} U|i \rangle$ satisfying $\sum_j |p_{kk'}^i(j)|\le 1$.

The key point here is that by regar

...(continued)

I've been reading your paper with interest but I think that the claim (top left of page 4) that $p^i_{kk'}(j) \geq 0$ and $\sum_j p^i_{kk'}(j) =1$ is incorrect.

I'd also be curious to know how you expect your algorithm to perform in the presence of sampling noise.

I think there is a mistake in the proof, which causes Theorem 2 to be incorrect. There should be an additional $2^n$ factor ($n$ is the number of qubits) in the number of experiments stated in Theorem 2. If Theorem 2 is true, then given any exponentially deep classical boolean circuits on $n$ bits,

...(continued)

Thanks for pointing out this nice paper. Our main results relate to single copy measurements, not multi-copy measurements (e.g. Hillary's paper with noiseless circuits but also https://arxiv.org/abs/quant-ph/0111082, which we do cite). We have also entanglement conditions in terms of only the first

...(continued)

Thank you for your reply, and I appreciate your revision in the next version.

Go right ahead! I'm glad you like it :D

Thanks Shu for the clarification. We will revise that description in the next version of our work.

I think they're supposed to be arm-wrestling, not making a deal. :)

This is beautiful, thank you, hahaha! A deal with the devil it is :D
Also... do you mind if I use this in a talk some day?

Corresponding software can be found here: [KadanoffBaym.jl][1]

[1]: https://github.com/NonequilibriumDynamics/KadanoffBaym.jl

Thank you for an interesting work and citation of our paper!
I'm reading your paper and noticed that our work is described as "Qubit and gate resources required for Trotterized Hamiltonian simulation algorithms of fully local Hamiltonians (without intercell interactions) have recently been investiga

...(continued)

For an article whose title starts with "the battle of clean and dirty", and about barren plateaus, I felt compelled to make a meme with this classic template! I hope you enjoy! (Please understand that I'm not trying to make any religious statement here :) )

![a meme of Jesus and Satan fighting ab

...(continued)

This paper for studying the optimality for collective measurements seems very interesting. One of the nice points of this paper is to apply error mitigation for metrology; however, our paper has already proposed error mitigation to metrology .... but it is not referred in this paper. Our paper demon

...(continued)

This paper of Hilary Carteret

https://arxiv.org/abs/quant-ph/0309216

already put forward the method given, for estimating the moments of the partially transposed density matrix of a bipartite state. It does not appear to be cited in the manuscript.

This is a cool result. The Glynn-Kan operator looks correct, which is really neat because it formulates solving the matrix permanent in terms of the expectation value (over the uniform superposition of **2N** qubits) of a diagonal 2-local Hamiltonian with **N^2** terms, which is straightforward to s

...(continued)

In order for this result to actually efficiently solve a #P hard problem, this result just needs to be able to approximate the permanent for any real matrix within *any* relative error. This is due to Corollary 6 of https://www.scottaaronson.com/papers/sharp.pdf.

If I recall correctly, the JSV al

...(continued)

Your answer is very clear!! Thank you very much, and this result is very interesting, and I will read this paper!

Hi Suguru, thanks for your question! We find exponential concentration of observables, as in a normal noise induced barren plateau. However, in our setting now the exponent is now rescaled by the ratio of the number of noisy qubits to the total number of qubits. So indeed this can be thought of as m

...(continued)

Thank you very much for a very interesting work! Does this work help the mitigation of noise induced barren plateau, i.e., the base of the exponential concentration of the observable is reduced?

Hi Steve, thanks for your comments.

Regarding your second concern:

This is addressed by the "Ising-type" recovery dissipators we define,
which have the form $aP$ with $a$ being the annihilation operator on a
given site and $P$ being a projector on a particular configuration of
domain walls surroun

...(continued)

I guess I have two concerns. First, it seems that to get a mathematical threshold requires taking $N\to\infty$. This fact does not say anything about finite-size scaling (as you point out), but it does mean that this proposal requires infinite energy density to have a true threshold. If infinite ene

...(continued)

Actually, our experiment and analysis goes up to 16 qubits, not 8 qubits, and uses a million measurements. Your paper estimates the number of measurements for 16 qubits at about 1e8, two orders of magnitude more pessimistic than what we found.

The quote I selected from our appendix mentions a certa

...(continued)

Hi Steve, Thanks for the comment. While $N\to\infty$ is the ideal limit, the logical phase-flip error rate is exponentially small in $N$ so that for practical purposes $N$ might not need to be too big to achieve the desired level of accuracy (such as for a single cat qubit experiment). Similarly, we

...(continued)

Ryan, mostly in the main text you write "...we propose a **scalable**, noise-resilient..." and "...the flexibility and **scalability** of our proposed approach..." etc. The emphasis on scalability certainly pervades the whole article and it's one of the main selling points. The appendix does not rea

...(continued)

This construction achieves self-correction by requiring the mean photon number N → ∞, which costs infinite energy per subsystem.

In Appendix F we write: “Therefore, as the system size increases towards the thermodynamic limit, we would expect that QC-AFQMC formally requires exponentially more measurements to maintain the relative precision”. I’m sorry if you found that statement unclear (the point of that appendix was to eluc

...(continued)

Several points of clarification are in order here:

1. We believe that referring to general computational complexity arguments to explain the intrinsic lack of scalability of a given algorithm only obfuscates the discussion and introduces further elements of confusion in the field.
The issue

...(continued)

The challenge referred to in this paper was first identified and discussed extensively in the original text by Huggins et al. - see, e.g., Appendix F. Although there are some differences, the problem is similar in spirit to the vanishing of initial state overlaps when preparing ground states via qua

...(continued)

Minor typo - de Beaudrap is spelled wrong in your abstract! Thanks for posting!

A previous construction of so-called "dual unitaries" from biunimodular functions appeared in
https://arxiv.org/abs/quant-ph/0306144. (See Theorem 7 and the discussion in section 4.)

Hi Johannes,

Sorry for the delay in responding -- this has been a busy period for both Bálint and myself.

We appreciate your input, and will certainly address these points comprehensively in an updated version of the paper.

Additionally, we will reach out to you to ensure that our comment

...(continued)

The approach of Jerrum/Sinclair/Vigoda is restricted to matrices with non-nonnegative entries. My understanding is that this is viewed as an "essentially easy" case, no? Joonsuk Huh's algorithm would be more exciting to apply to matrices that include negative entries?

The claim made in the final sentence of this abstract is not substantiated by any available evidence. This sort of hype is detrimental to the quantum computing field and should be called out, especially when it is difficult to believe such claims are made in good faith.

Thanks a lot for your quick answer!

Regarding the normal distribution, I think there is a difference in the meaning of $N=2^n$ in our papers; for you it appears to be the resolution over a fixed domain (if I'm not mistaken?), whereas in 2009.10709 it is an absolute coordinate. This means that in

...(continued)

Dear Johannes,

Thank you for your comment. The black-box state preparation techniques you have referenced are quite interesting and will certainly be useful in practice!

In the following, we assume that $n$ is the number of qubits, and $N = 2^n$ is the resolution.

First, our query complexi

...(continued)

Dear Arthur, dear Balint,

Really interesting paper, thanks! As Craig I have a question regarding your technique's efficient, namely in comparison to known black box state preparation tasks, for instance 1807.03206, 2009.10709, and more recently 2105.06230. (1) and (2) are of the same nature; (3)

...(continued)

In https://dl.acm.org/doi/10.1145/1008731.1008738 it is shown how to classically approximate within polynomial time the permanent up to some given error epsilon. The trick there is that the time dependence is on poly(1/epsilon). If the time dependence is poly(log(1/epislon)) then the problem becomes

...(continued)

We refer to the algorithm as *quasi-deterministic* because (for analytical convenience) we only proved our error-bound using a single outcome of the measurement of the ancillary register (which happens asymptotically with probability 1), and assumed that we rejected all other outcomes. However, in p

...(continued)

Ah, the deterministic aspect is important in some chemistry algorithms based on PREP+SELECT oracles. PREP is a bit poorly named because it has to run in contexts where its input is not all reset qubits, in order to maintain coherence during amplitude amplification. You would want to have very good c

...(continued)

Hello Craig,

Thank you for your question.

While rejection sampling adds an ancillary qubit to an initial state and applies conditional single-qubit rotations to it (such that after measuring out the ancilla qubit the desired state is obtained with some probability), we go all the way and devi

...(continued)