Giter Site home page Giter Site logo

Comments (5)

rtvuser1 avatar rtvuser1 commented on July 30, 2024

Fig 9 in the paper does show a "Circuit Depth" of 31 as you mention (after one level of decompose).
But it also shows the "Transpiled Depth" as ~78 which you also indicate is the correct depth. What is shown in the bar chart seems to match your numbers. I am not clear what it is that you are reporting as incorrect ... perhaps you can clarify?

Note that the "Transpiled Depth" is what we use as a "normalized" depth for the x coordinate in the volumetric plots.

The assumption was also made is that the transpilation does not account for connectivity, so the larger depth due to swapping of qubits will not show in these charts. They are intended to represent a normalized depth independent of any knowledge of connectivity. The other issue you mentioned about qubit mapping might address some of this concern. See the comment there.

from qc-app-oriented-benchmarks.

nonhermitian avatar nonhermitian commented on July 30, 2024

Ok I see. It is a bit confusing because there is only a mention of the basis set [‘rx’, ‘ry’, ‘rz’, ‘cx’], which is not what decompose() gives you. The end of Sec 3C also says:

‘circuit depth’ always refers to our normalized
definition for circuit depth unless otherwise stated

which makes you think it uses the above mentioned basis set given that the figure legend says "Circuit Depth" for the decomposed data. The only way the corresponding transpiled data could be any deeper is if going to the IBM default basis and including swaps.

from qc-app-oriented-benchmarks.

rtvuser1 avatar rtvuser1 commented on July 30, 2024

I agree it is a bit confusing. Concrete suggestions on how to make clear both in the repo and paper are welcome!
Note that the decompose(0 is primarily being used to "flatten" the circuits, as we use subcircuits everywhere

from qc-app-oriented-benchmarks.

nonhermitian avatar nonhermitian commented on July 30, 2024

I would just use the "transpiled" data for the "Gate depth" data and just drop the former. There is no need for the decomposed data as the decomposition definitions are someone arbitrary. It also clears things up a bit because when listing fidelities right above "transpiled" depths, it is natural to assume that that depth is what was run on the HW to generate the corresponding fidelity right above it.

from qc-app-oriented-benchmarks.

rtvuser1 avatar rtvuser1 commented on July 30, 2024

Closed after clarification on the explanation in the paper

from qc-app-oriented-benchmarks.

Related Issues (16)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.