{'fraction_non_alphanumeric': 0.03402622321714103, 'fraction_numerical': 0.012759833706427887, 'mean_word_length': 4.275050607287449, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 17, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Practically feasible robust quantum money with classical verification

We introduce a private quantum money scheme with the note verification procedure based on Sampling Matching, a problem in the one-way communication complexity model introduced by Kumar et al.[Nature Communications 10, Article number: 4152]. Our scheme involves a Bank that produces and distributes quantum notes, noteholders who are untrusted and trusted local verifiers of the Bank to whom the holders send their notes in order to carry out transactions. The key aspects of our money scheme include: note verification procedure requiring a single round classical interaction between the local verifier and Bank; fixed verification circuit that uses only passive linear optical components; re-usability of each note in our scheme which grows linearly with the size of note, and an unconditional security against any adversary trying to forge the banknote while tolerating the noise of up to 21.4%. We further describe a practical implementation technique of our money scheme using weak coherent states of light and the verification circuit involving a single 50/50beam splitter and 2 single-photon threshold detectors. Previous best-known matching based money scheme proposal [AA17] involves a verification circuit where the number of optical components increase proportionally to the increase in desired noise tolerance (robustness). In contrast, we achieve any desired noise tolerance (up to a maximal threshold value) with only a fixed number of optical components. This considerable reduction of components in our scheme enables us to reach the robustness values that are not feasible for any existing money scheme with the current technology.


Introduction
In the 1980s, Wiesner [Wie83] proposed the idea of quantum money to create unforgeable banknotes with quantum states. In his scheme, the banknotes are several BB84 states prepared by an honest authority, Bank, who then distributes them to the untrusted holders. When the holders need to carry out a transaction with their note, they send the entire note to the Bank for verification, who declares its validity. The unforgeability property of the note in Wiesner's scheme relies on the no-cloning property of quantum mechanics which prevents the holder from creating multiple copies of the notes with just a single copy [WZ82]. This idea was incidentally also among the first quantum cryptographic primitives to be introduced. Subsequently, other cryptographic tasks based on quantum mechanics have been proposed such as quantum key distribution, digital signatures, coin flipping, secure multi-party computation, etc [BB14,GC01,Amb04,BFK09,CGS02,BS16].
This Wiesner money scheme, as analysed independently by Lutomirski et al. [Lut10] and Brodutch et al. [BNSU14], soon ran into security problems. The first issue was (a) verification of the note required a quantum communication channel between the holder and the Bank. As pointed out by Gavinsky [Gav12], an adversary can interfere in the channel and possibly modify or destroy the note; (b) the scheme is insecure against several previously un-analysed attacks, the adaptive attacks [BNSU14] where an adversary can substantially increase the note forging probability by communicating with the Bank in a few "auxiliary" number of rounds.
These two drawbacks were first addressed by Gavinsky [Gav12] in his proposal of a private quantum money scheme based on quantum retrieval games (QRG). Informally, these games consist of a set of challenges where answering a single challenge from the set is easy, however answering multiple challenges simultaneously is hard i.e. cannot be answered with a unit probability. Gavinsky's scheme involves an honest Bank that prepares and distributes notes which are quantum states prepared some random basis, untrusted noteholders and trusted local verifiers of the Bank who run a test on holder's note to check for its validity. The security of this scheme relies on the fact that an honest user must always pass the verifier test who picks a single challenge from the set at random. A dishonest user who wants to forge the note has to simultaneously succeed in answering any two challenges picked from the set at random by two independent verifiers. Thus the hardness of forging the banknote links to the hardness in answering any two different challenges picked at random from the set. The verification of the note in Gavinsky's scheme requires two rounds of classical communication between the Bank and the verifier and is proven to be secure against any type of adaptive adversary attacks. This scheme, however, is not realistic since it only works when no experimental noise is taken into consideration. Also, since the verification procedure requires two rounds of communication, this forces the Bank to have a temporary "active" classical memory during the verification phase which would limit the number of independent note verifications that the Bank can perform at any given instant.
Further independent works on similar lines by Georgiou et al. [GK15] and Amiri et al. [AA17] have reduced the classical communication required for note verification to a single round. The scheme of [GK15] is based on 1-out-of-2 QRG i.e. the holder can deterministically answer any one of the two challenges, however, it is impossible for him to answer both the challenges simultaneously with a unit probability. This scheme tolerates the noise of up to 12.5%. The other scheme of [AA17] is based on Hidden Matching quantum retrieval games, HM-QRG [GKK + 07, AKL16], and exhibits the noise tolerance of up to 23.3%. They further conjecture that maximal noise tolerance for money schemes based on Matching QRGs can reach up to 25%. Here the noise tolerance, a measure of the robustness of the scheme, is defined as the maximum theoretical probability that an honest verifier returns an incorrect outcome. Higher the noise tolerance, more robust is the money-scheme against errors incurred on the honest holder's note due to experimental imperfections. And as long as the errors on the honest holder's note is within the noise tolerance, the money scheme would demonstrate an information-theoretic security against a forger trying to forge the banknote. In parallel, several other theoretical proposals of quantum money schemes have been proposed, both as private and public money schemes [PYJ + 12, AC12, FGH + 12, MP16]. Besides, there has been a recent proposal on semi-quantum money [RS19] where the Bank only has classical resources and delegates a classical message to the user who prepares the quantum note. The security of this scheme is however computational and relies on the security provided by learning with errors (LWE), a problem believed to be post-quantum secure.
To date, there have been two proof-of-principle experimental demonstrations for private quantum money based on one round of classical verification with the Bank. The first by Bozzio et al. [BOV + 18] is based on the theoretical scheme of [GK15]. Their encoding of quantum money is in polarized weak coherent states and achieves the honest noteholder error rate slightly below β = 4% which is well under that maximum noise tolerance of 12.5%. The other demonstration is by Guan et al. [GAA + 18] which is based on the theoretical scheme of [AA17] has an encoding based on phase parity of corresponding pairs of weak coherent states. Their implementation achieves a measured honest holder error rate of β = 3%, while the theoretical noise tolerance of the scheme is 16.6%, thus making it secure. Inspite of the maximal noise tolerance of 23.3% proposed in the theoretical scheme, the experimental scheme was limited to 16.6%. The reason for this being that for the protocols based on matching schemes, the tolerance against the noise increases with the input size of the note. Thus the money scheme becomes more robust against experimental imperfections and forging by going to higher input sized banknotes. For the schemes based on Hidden Matching, the verification protocol involves a complex circuit with the number of optical elements (active switches, delays, beam splitter) increasing at least logarithmically with the input size. This gets increasingly difficult to implement the circuit for large input sizes. Hence the only implementation based on Hidden Matching has been shown for input size n = 4 which leads to a noise threshold of 16.6%. This is the primary motivation of our theoretical work which simplifies the verification circuit to be able to experimentally achieve much higher noise tolerance than any other current private money scheme.
In this work, we introduce a private quantum money scheme using single-photon quantum states and the verification protocol based on Sampling Matching (SM) scheme. This scheme was proposed by Kumar et al. [KKD19] as a problem in a one-way randomized communication complexity model. The authors showed that solving this problem using quantum resources exhibits an exponential reduction in communication compared to classical resources. They further experimentally demonstrated the quantum protocol using weak coherent states and linear optics operations. The simplicity of the problem allowed for the construction of such a quantum protocol consisting of only O(1) 50/50 beam splitters and two threshold detectors independent of the problem size. This led to the first experimental realization of quantum advantage in one-way communication complexity. This problem is described in more detail in the section 2.2.
We propose two distinct encoding of private quantum money schemes. The first proposal uses singlephoton states to create a quantum note. The single-photon encoding is the realisation of a qubit/qudit with linear optics. Thus defining our money scheme in this picture makes it more translatable to other qubit encoding pictures for experimental demonstrations. Our money scheme, while achieving a noise tolerance of 21.4%, offers much simplicity in the implementation of the verification protocol compared to the existing Hidden Matching based protocols [AA17]. In our verification scheme with single-photon states, even though the number of linear optical components grows linearly with the input size, the optical components required are just passive 50/50 beam splitters with no need for active switch components. This allows our circuit to be fixed for a given input size of the note, in contrast to the scheme of [AA17] which requires a programmable verification circuit thus necessitating the need for having active components.
In the second part, we describe a practical implementation technique of our money scheme using weak coherent states and the verification circuit consisting of a single 50/50 beam splitter and 2 single-photon threshold detectors. Here we show that it is experimentally possible to achieve a noise tolerance as high as 21.4%, something not possible for any other scheme with the current technology.
The paper is organized as follows. In section 2.1 we define the private quantum money including the notions of correctness and unforgeability. In section 2.2 we introduce the tools required to construct our money scheme. This includes defining a modified version of the SM problem and SM scheme with singlephoton states. In section 3.1 we formally introduce our quantum money scheme using SM verification. Sections 3.2 and 3.3 analyses the security of our money scheme and prove that it exhibits an informationtheoretic security. Finally, in section 3.4 we describe the practical implementation technique of our quantum money scheme using coherent states and threshold detectors.

Materials and Methods
This section focuses on the necessary definitions and tools required for the construction of our quantum money scheme.

Definitions for Private Quantum Money
A private quantum money scheme involves an algorithm used by a trusted entity, Bank to produce multiple notes, and a protocol that is run between a holder H of the note and the Bank to verify the authenticity of the note. The requirement for the verification protocol to be secure is that it must be impossible for an adversary noteholder to create more notes than what it received from the Bank.
Definition 2.1. Private quantum money. A quantum money scheme with classical verification consists of an algorithm by the Bank, and a protocol, Verification, such that, 1. Bank algorithm produces a quantum note $ = (ρ, s.n.) where ρ is a quantum state of the note and s.n.
is the classical serial number of the note.
2. Verification is a protocol with classical communication that is run on the note $, between the noteholder H who claims to possess the note $ and the Bank. The output of the protocol is a bit declared by the Bank to denote whether the note is valid or not. We denote this final bit as Ver B H ($) which is 1 when the Bank validates the note and 0 otherwise.
For this scheme to be secure, it must satisfy two important properties, • Correctness: The scheme is correct if for every honest holder H, it holds that • Unforgeability: The scheme is unforgeable if for any quantum adversary who possesses m notes, has interacted a finitely bounded number of times with the Bank and has managed to produce m notes $ 1 , $ 2 , · · · , $ m , it holds that, where H is any honest noteholder. The probability in the -unforgeability property is taken over all possible strategies of an unbounded adversary. The correctness condition ensures that all the honest noteholders get their note verified with an exponentially close to 1 probability (by setting exponentially close to 0). While the unforgeability condition ensures that an adversary trying to create more notes than what she had originally from the Bank, would fail with an exponentially close to 1 probability in being able to verify all the notes. Our definition includes the possibility of adaptive attacks by the adversary since we allow the interaction with the Bank a finite number of times during the verification protocol.
However, proving the security of such a general money-scheme can be a cumbersome task. To mitigate this Aaronson and Christiano [AC12] introduced the concept of a smaller public money scheme (minischeme) and showed that it is sufficient to prove the security of this smaller version to guarantee security of the full scheme. Subsequently Ben-David and Sattath [BDS16] showed similar results for private money schemes using their construction of a private tokenized signature scheme. Such a signature scheme is used to produce signed documents that are publicly verifiable, unfeasible to forge by a third party, and has the property that the signing authority can produce and distribute one-use quantum signing tokens that allow the holder to sign only 'one' document of her choice. The cryptographic assumption for the existence of such a private tokenized signature scheme is the existence of a collision-resistant hash function which is secure against quantum adversaries. There are various candidates for collision-resistant hash functions that are believed to be secure, so its reasonably valid assumption [Gol04].
Under this mini-scheme, the Bank produces a single quantum note $. The goal of the note adversary is, after finite interactions with the Bank, to produce two quantum notes $ 1 and $ 2 which successfully passes the verification test of the Bank. In this scheme, since the Bank produces only a single note $, hence it does not require an attached classical serial number.
Definition 2.2. Private quantum money mini-scheme. A quantum money mini-scheme with classical verification consists of an algorithm by the Bank, and a protocol, Verification, such that, 1. Bank algorithm produces a quantum note $ = ρ where ρ is a quantum state of the note.
2. Verification is a protocol with classical communication that is run on the note $, between the noteholder H who claims to possess the note $ and the Bank. The output of the protocol is a bit declared by the Bank to denote whether the note is valid or not. We denote this final bit as Ver B H ($) which is 1 when the Bank validates the note and 0 otherwise.
For this scheme to be secure, it must satisfy two important properties, • Correctness: The scheme is correct if for every honest holder H, it holds that • Unforgeability: The scheme is unforgeable if for any quantum adversary who possesses the note $, has interacted a finitely bounded number of times with the Bank and has managed to produce two notes $ 1 and $ 2 , it holds that, where H is any honest noteholder.
To go from a private quantum money mini-scheme to a full scheme, it is enough for the Bank to add a serial number to a note of the mini-scheme. Then the Bank can just run the verification protocol of the mini-scheme for that note with the serial number. We, therefore, propose a quantum money mini-scheme and rely on the above results to extend this mini-scheme into full scheme.

Tools for the Money Scheme
In this sub-section, we describe the primary tool required for the construction of our money scheme, the Sampling Matching problem. This problem was originally defined by Kumar et al. to demonstrate a quantum advantage in one-way communication complexity setting [KKD19]. We use a variant of the original problem to construct the verification scheme for the honest verifier.

Sampling Matching problem
The Sampling Matching problem as illustrated in Figure 1 consistes of two players, Alice and Bob. For any positive integer n, Alice receives a binary string x ∈ {0, 1} n . Bob, on the other hand, does not receive any input. His task is to sample a tuple (k, l) on the complete graph of n vertices (with the vertices being indexed with numbers {1, 2, · · · , n}) uniformly at random from a set of T n containing n(n − 1)/2 distinct tuples. An example of the tuple set for n = 4 is T 4 : (1, 2), (3, 4), (1, 3), (2, 4), (1, 4), (2, 3) .
The objective of the problem is for Bob to output any tuple (k, l) from T n and the parity x k ⊕ x l (where x k , x l are the k th and l th bit of x respectively). We look at the model of one-way communication where we only allow a single message from Alice to Bob. Figure 1: Sampling matching problem. Alice receives an input x ∈ {0, 1} n and Bob does not receive any input. Alice sends a message m(x) to Bob who outputs the tuple {(k, l) ∈ T n , x k ⊕ x l } where the from the message m(x), a tuple (k, l) is sampled from the set of possible distinct tuples T n . Bob's objective is to output the parity correctly with high probability. For our quantum money proposal, we study the case when Alice is the untrusted noteholder and Bob is an honest note verifier. In the following, we construct a scheme for Bob to sample a tuple (k, l) from the set T n when Alice sends a quantum message to Bob. We analyse Bob's scheme when the message sent by Alice is a single-photon state in a superposition over n modes.

Sampling Matching Scheme with Single-photon States
Sampling Matching scheme is Bob's testing scheme to sample the parity outcome of a tuple from the set T n containing n(n − 1)/2 distinct tuples. Here we look at the testing scheme when Alice's quantum message to Bob is a single-photon state.
The technique is depicted as follows: When an honest Alice receives the binary string x ∈ {0, 1} n , she encodes the information of this string into a single-photon state in a superposition over n different modes, where x k is the k-th bit of the string x. The operatorâ † k is the creation operator for the k-th mode, and, Figure 3 illustrates a method to create of equal superposition state of Eq.(5) by passing the initial stateâ † |0 through the cascade of n − 1 50/50 beam splitters and adding the phase information of each bit of the input in the n modes.
Alice sends this state |x to Bob. In order to determine the parity outcome of a tuple, Bob first prepares his local superposition state in n-modes, Figure 3: Superposition circuit of Alice to create a single-photon state in equal superposition over n modes. This is realised by passing a single-photon through a cascade of n − 1 50/50 beam splitters and subjecting each output mode to a phase-shift that depends on the corresponding string x ∈ {0, 1} n .
whereb † k is the creation operator for the k-th mode withb † k |0 = |1 k . Bob's action is to apply mode-by-mode beam splitter operation on the state |x ⊗ |β . This is illustrated in Figure 4. Figure 4: Sampling Matching circuit model in single-photon encoding. Alice encodes a secret string x ∈ {0, 1} n in the single-photon state |x in an equal superposition over n modes. This is then sent to Bob. Bob creates his local superposition state and applies mode-by-mode beam splitter operation with Alice's state. The results are observed in the 2n photon number resolving detectors.
Prior to the beam splitter operation, the input of Bob is, Figure 5. This input to output mode conversion for the 50/50 beam splitter is given From Figure 4, we see that the k-th mode of Alice's state interacts with k-th mdoe of Bob's state, for all k ∈ [n]. The output operatorÔ † corresponding to this joint interaction for all the modes is, . This is because by notationĉ † acts on the first qubit while thed † acts on the second qubit. Here T n is the set of all possible n(n−1) The output Eq.(10) is then observed in the photon number resolving detectors. Since there are two input photons to the circuit, Bob will observe two-photons clicks across the 2n output modes (here we assume perfect set-up and detection) labelled as {c 1 , d 1 , · · · , c n , d n }. From Eq.(9) Bob will observe one of the following scenarios, • Simultaneous single-photon clicks in {c k , c l } or {d k , d l }, for two distinct modes (k, l), implies x k ⊕ x l = 0.
• Simultaneous single-photon clicks in {c k , d l } or {d k c l }, for two distinct modes (k, l), implies x k ⊕ x l = 1.
• 2 photons in the same mode c k or d k does not reveal the parity outcome for Bob and hence results in inconclusive outcome.
We denote the output state corresponding to single-photon detection in the two distinct modes {c k , d l } as |11 c k ,d l . The same notation is followed for output states corresponding to single-photon detection in distinct modes {c k , c l } or {d k , d l }. The output state corresponding to two-photon detection in the same modes c k or d k is denoted as |20 c k and |02 d k respectively. From Eq.(9), we see that the probability of observing 2 photons in the same mode c k is, where we have used the property of creation operators thatĉ 2 † k |00 = √ 2 |20 c k . Similarly, the probability of observing 2 photons in the same moded k is, where the similar property of creation operatorsd 2 k |00 = √ 2 |02 d k has been used. Over all the 2n modes, the probability of having 2 photons in the same mode is, In these cases, Bob does not get a conclusive parity outcome of any two bits of x. When this occurs, he outputs the outcome d = ∅.
On the other hand, with probability 1 − 1 n , Bob always gets exactly two single-photon clicks in two different time modes k, l ∈ [n] with correct parity outcome d = x k ⊕ x l . The probability that he outputs the parity outcome of a tuple (k, l) ∈ T n , is the operator corresponding to the correct parity outcome for the tuple (k, l). Operationally this operator generates only single-photon clicks in modes {c k , c l or {d k , d l } if x k ⊕ x l = 0, while single-photon clicks are generated in {c k , d l or {d k , c l } if the corresponding parity is 1. Note that for the incoming state |x from honest Alice, if Bob observes simultaneous single-photon clicks in two distinct modes, it's parity outcome is correct with certainty. Hence if Alice is dishonest and sends a state different from |x , it is enough to show that after the mode-by-mode beam splitter interaction with Bob's state |β , there is a non-zero probability for Bob to obtain an incorrect parity outcome x k ⊕ x l across the tuples (k, l) ∈ T n . This forms the basis of our unforgeability test using Sampling Matching based verification.

Private Quantum Money Scheme
Our quantum money scheme involves a Bank that produces the notes which are quantum states and distributes them to untrusted noteholders. Each time a holder needs to carry out a transaction, he sends the note to the trusted local verifiers of the Bank who help the Bank decide the validity of the note. The salient features of our money scheme include: • Note verification procedure requiring a single round classical communication between the local verifier and the Bank, • Fixed verification circuit for a given input size of the note, • Multiple note re-usability, meaning the same note can be reused by the holder a number (linear in the size of the note) of times, • Unconditional security against any adversary trying forge the banknote while tolerating a noise of up to 21.4%.
Our scheme involves two phases. First is the Note preparation phase, where the Bank chooses multiple n-bit binary strings independently and uniformly randomly. Each of these strings are then encoded into single-photon states in superposition over n modes. The quantum note $ is the combination of single-photon states corresponding to all the chosen strings. This is then distributed among the untrusted holders. In the Verification phase, the holder's note is sent to the local verifier for testing. The verifier randomly selects some copies of the note state (here the note consists of multiple copies, where one copy corresponds to the single-photon state that encodes one n-bit string). He runs the verification protocol using the Sampling Matching, SM scheme (Section 2.2.2) and does a local check based on the statistics of the classical outcome obtained. If the statistics are different from the ones produced by the note of an honest holder, he invalidates the note. If the note passes this test then the outcomes are classically communicated to the Bank. The Bank compares these outcomes with his private n-bit strings. If a high fraction of the outcomes is correct, he outputs the bit Ver B H = 1 implying that the note is valid. Otherwise, he outputs Ver B H = 0. The money scheme we use here is the quantum money mini-scheme. Under this scheme, the Bank produces a single quantum note $, consisting of many copies of single-photon states. The goal of the note adversary is, after finite interactions with the Bank, to produce two quantum notes $ 1 and $ 2 which successfully pass the verification test by two independent verifiers. We have already emphasized that we make use of previous results [BDS16] which lifts the security against any adversary from a private quantum money mini-scheme to the general scheme with multiple notes and a classical serial number assigned to them.
We now describe the quantum money mini-scheme based on single-photon states, 50/50 beam splitter linear optics transformations and photon number resolving detectors.

Note Preparation Phase
1. The Bank independently and uniformly randomly chooses q n-bit binary strings x 1 , x 2 , .., x q ∈ {0, 1} n 2. The Bank encodes each binary string x j into the single-photon state in superposition over n modes, Figure 6: Illustration of our private quantum money scheme based on the verification protocol using the Sampling Matching scheme. In the Note Preparation phase, the Bank independently and uniformly randomly selects q n-bit binary strings {x 1 , · · · , x q } and prepares single-photon superposition note states $ = |x 1 ⊗ |x 2 ⊗ · · · ⊗ |x q . The Bank further initializes a r register to keep a track of the number of positions in [q] where the states have been used for verification and the count register to keep track of a number of verification attempts on the note. The note ($, r) is then sent to the holder. To be able to carry out any transaction, the holder sends the note to an honest verifier. In the Verification phase, the verifier selects a fraction of the q copies of the note state which have an r = 0. He creates his local state |β and applies the SM-scheme on those selected copies. The verifier sends the outcome of the measurement scheme to the Bank. Finally, the Bank compares the outcomes with his secret string x j 's and outputs a bit Ver B H stating whether the note is valid or not.
where x j,k is the k-th bit value of string x j andâ † k is the creation operator for the mode k witĥ a † k |0 = |1 k . The note is a combination of all the q copies of the single-photon state $ = |x 1 ⊗ |x 2 ⊗ · · · ⊗ |x q .
3. The Bank creates a classical binary register r and initializes it to 0 q . This register keeps the track of positions j where the states have been used for the verification.
4. The Bank creates a counter variable count and initializes it to 0. This keeps a track of the number of verification attempts.
5. The Bank sends the quantum note ($, r) to the holder.

Verification Phase
Once the Bank distributes the note, the holder in order to carry out any transaction has to get the note verified from an honest local verifier Ver. The verification procedure is described below.

Local testing
1. The holder gives the note $ (=: $ if the holder is honest) to Ver.
2. Ver checks for the number of times the note has be re-used by verifying that the hamming distance of r register d(r, 0 q ) T , where T is a predefined maximum number of copies in the note that are allowed for verification. If d(r, 0 q ) > T , the note is rendered useless.
3. Ver uniformly and randomly selects a subset L ⊂ [q] copies from the states marked r = 0. All the corresponding L copies in the r register is then marked to 1.
4. For each chosen copy j ∈ L, Ver prepares his local coherent state |β and runs the SM scheme (Section 2.2.2).
5. Ver first checks if he gets 2 photon clicks in all the chosen L copies. If not, he rejects (this is a check against all those attacks where the adversary removes the single-photon state and introduces either vacuum or a multi-photon state).
6. Ver counts the number of successful copies l succ , where he obtains two single-photon clicks in two different modes. For these copies he outputs the parity outcome d j = x j,k ⊕ x j,l where the clicks have been obtained in modes k and l. For the rest of the copies, he sets d j = ∅.
7. Ver checks if l succ l min , where l min = E h [l succ ](1 − ) is the minimum number of copies that will locally guarantee his acceptance of the note, where 0 1 is the desired security factor. Here E h [l succ ] is the expected number of copies where the honest noteholder obtains two single-photon clicks in two different modes when Ver runs the SM scheme.
8. Ver proceeds to the classical communication step with the Bank only when the note passes this test.
Communication with the Bank 1. Ver forwards the outcomes {j, (k, l), d j } for each j ∈ L to the Bank through a classical authenticated channel.
2. The Bank checks if count < T |L| , otherwise the verification attempt is rendered invalid. Here · is the ceiling function.
3. For each copy j ∈ L with d j = ∅, the Bank compares the parity value d j with the secret string x j .
He validates the note if the number of correct outcomes where E h [l cor succ ] is the expected number of copies that give the correct parity outcome when the noteholder is honest, and 0 δ 1 is a positive constant whose optimal value is determined by the forging probability (Section 3.3).
4. The Bank updates the count by 1.

Correctness
Let us start by computing the probability that an honest noteholder fails the verification test. We use the Chernoff-Hoeffding inequality [UM05] to prove our results.
We first remark that the honest noteholder always passes the step 5 of the Verification phase, since he sends the entire banknote to the verifier Ver, who after performing the SM-scheme on the chosen L copies, always obtains the two-photon clicks.
However, the noteholder can fail the step 7 of the Verification phase if the number of successful copies, where he obtains two single-photon clicks in two different time modes, l succ < l min = E[l succ ](1 − ), where E[l succ ] is the expected number of copies where Ver obtains two single-photon clicks in two different modes when he runs the SM scheme, and is the security parameter chosen by Ver. Eq.(13) tells us that for each of these chosen copy j ∈ L, the probability that the verifier obtains two single clicks in two different time modes is, Thus for L copies chosen from the note state, the expected number of successful copies is, Using the Chernoff-Hoeffding bound, the probability that the holder fails this test is, Now after applying the SM scheme, Ver forwards the parity outcomes to the Bank. From Eq.(9), we see that whenever Ver obtains a parity outcome of a tuple (k, l), it is always correct. Thus the probability that the Bank obtains correct parity outcome for each of the l succ copy is c = 1. This implies l cor succ = l succ and that the only stage where an honest noteholder can fail is the local verifier stage.

P[Honest
This probability of failing goes down exponentially with , |L| and n.

Unforgeability of Banknotes
In this section, we explicitly calculate the forging probability for the adversary when she has in possession the valid banknote $ and his objective is to duplicate the note to create two copies $ 1 and $ 2 , which successfully pass the verification tests from two independent verifiers, Ver1 and Ver2, simultaneously 1 Based on our scheme construction, any action by the adversary who is trying to maximize the forging probability can be put into three categories as specified detailed below. The first two categories, register manipulation, and adaptive forging, arise due to the addition of multiple reusability feature in our note. This can be leveraged by the adversary by performing 'auxiliary' verification attempts on the note and thereby learning more information on the note state leading to an increase in the forging probability. The third category relates to an optimal quantum operation performed on the note state such that the resulting states 1 Our proof technique has been inspired from the work of Amiri et al. [AA17] which is a private quantum money scheme with the verification based on Hidden Matching [BYJK04], another well-defined problem in one-way communication complexity. Kumar et al. [KKD19] showed similarities between Sampling Matching and Hidden Matching communication problems. Here we manage to find that our proof of unforgeability has a similar structure to [AA17] even though the circuit to realise them is vastly different. sent to Ver1 and Ver2 can pass the verification test with high enough probability. Our proof of unforgeability takes into account the optimal action by any adversary on all these three categories.
1. Register manipulation. First, we address how manipulating the r register can be used by an adversary to increase the forging probability. Since in each verification attempt the verifier chooses |L| copies from the note state, and the maximum number of note verification attempts allowed by the Bank is T , hence the adversary can set at most (T − 1)|L| positions in the r register to 1 before sending the note state to the verifier. This ensures that the verifier does not render the note useless while checking the hamming distance of the r register. Further, since the verifier only selects copies from the note state marked 0 in the r register, setting maximum possible positions in r to 1 allows the adversary the need to deal with lesser copies (0 marked states) of the note state.
Suppose the adversary creates two notes ($ 1 , r 1 ) and ($ 2 , r 2 ) and sends it to the verifiers Ver1 and Ver2 respectively. If the adversary sets r 1 (j) = 0 and r 2 (j) = 1 for the j-th copy of the note, she is sure that Ver2 will not select the state at j-th position for verification. With this approach she can set a maximum of (T − 1)|L| positions in r 1 and r 2 register to 1. In the positions where she has set r 1 = 1, she can send the correct banknote states to Ver2, and similarly for the positions where she has set r 2 = 1, she can send banknote states to Ver1. This results in her exactly replicating the 2(T − 1)|L| copies of the note state for both verifiers.
2. Adaptive forging. Let us now also consider the possibility of the adaptive attack by the adversary where multiple 'auxiliary' verification attempts made on the note state would help increase her forging probability. Since the Bank allows a maximum of T verification attempts on the note, hence the adversary can use this to his advantage by querying for validation of (T − 2)|L| copies (since he needs to leave 2 verification attempts, one each from Ver1 and Ver2). We assume the worst-case scenario where the adversary completely obtains the information of the state for those copies used in auxiliary verification attempts.
The above two categories of attacks (r register manipulation and the adaptive attack) combined allow the adversary to have full information of a combined (3T − 4)|L| copies of the note state.
3. General forging. Now to prove the unforgeability condition, we consider what happens in the remaining q = q − (3T − 4)|L| copies of the states sent to Ver1 and Ver2 where the adversary has no auxiliary information of the states and for which r 1 (j) and r 2 (j) are 0. In this scenario, an optimal adversary operation is to produce two note states with q copies each (one each for Ver1 and Ver2) such that the average fidelity of the prepared states with the correct note state is maximised. This maximisation directly translates to the probability with which verifier obtains correct outcomes upon performing the Sampling Matching scheme. 2 There are two possible attack models that the adversary can employ on the note state. First is the collective attack based on optimal manipulation on individual copies of the note state. The second, more general model, is coherent attack where the adversary performs a combined operation on the entire note state. We start with the collective attack and subsequently use the results by Croke and Kent [CK12] to argue that any coherent strategy by the adversary is no more powerful than the optimal collective strategy.

Collective attack:
Here we look at the optimal manipulation strategy on individual copies of the note state. First, we remark that the adversary has to send a single-photon state across each the q copies to Ver1 and Ver2, otherwise he fails the step 5 test in Verification phase with certainty. For each copy j ∈ [q ], the adversary possesses the valid banknote state |x j ( Eq 15). Using this copy, his most general operation would be, where ρ j,HV 1 V 2 is a general tri-partite quantum state that the adversary (H) creates between her, Ver1 (V 1 ) and Ver2 (V 2 ). The state received by Ver1 is then η x j = T r HV 2 (ρ j,HV 1 V 2 ), where T r HV 2 (.) is partial trace over adversary and Ver2's state. Similarly the state received by Ver2 is τ x j = T r HV 1 (ρ j,HV 1 V 2 ). Any normalized mixed state sent to Ver1 over n-modes can be expressed as, whereâ † k is the creation operator of the k th mode, and A kl ∈ C for all k, l ∈ [n]. The normalization of the mixed state invokes the condition n k=1 A kk = 1. Ver1 runs the Sampling Matching scheme on the input state as shown in Figure 4. The input of the interaction of the adversary state with the local state of Ver1, |β = 1 √ n n k=1b † k |0 , can be written as a combined density matrix state, This state undergoes mode-by-mode beam splitter operation (Figure 4) resulting the transformation of the modesâ i →ĉ i +d i . The corresponding output state is, Similar to the analysis in section 2.2.2, we first compute the probability (p 11 ) with which Ver1 observes single-photon clicks in two distinct modes. This probability p 11 = 1 − p 2 , where p 2 is total probability of observing two-photon clicks in the same mode. For output mode c k , The corresponding probability of observing two-photon clicks in mode d k is, Summing over all the 2n modes, where we have used the normalisation condition n k=1 A kk = 1. Comparing Eq.(13) and Eq. (27), we see that the total probability of obtaining 2 photons in the same mode for an adversary is the same as that for an honest noteholder. Thus for any adversarial state with a single-photon over n modes, Ver1 observes two single-photon clicks in two distinct output modes with a probability p 11 = 1 − 1 n . Over the L copies chosen by Ver1, he receives on average |L|p 11 copies with single-photon clicks in two distinct modes. This implies that the adversary passes the local step 7 of Ver1's Verification Phase test with probability, where l succ is the total copies where he gets single-photon clicks in two different modes and l min = |L|p 11 (1 − ). If the adversary passes this test then Ver1 communicates the parity outcomes of l succ copies to the Bank who checks the outcomes with his secret strings.
We now calculate the average probability that the tuple (e, f ) ∈ T n that Ver1 obtains for the j-th copy, returns an incorrect parity outcome. Based on the analysis in section 2.2.2, we see that an incorrect outcome is obtained if Ver1 obtains single-photon clicks in the modes {c e , c f } or {d e , d f } when x j,e ⊕ x j,f = 1, while single-photon clicks are obtained in {c e , d f } or {d e , c f } if the corresponding parity is 0. This probability of obtaining an incorrect parity outcome for the tuple (e, f ) ∈ T n is, fĉ † e ) is the operator for the tuple (e, f ) that corresponds to incorrect parity outcome of the e-th and f -th bit of Bank's secret string x j . Comparing with the operatorT † ef in Eq 14, we observe that the operatorÎ † ef has a negative sign in the second term, which corresponds to an incorrect outcome. OperatingÎ † ef on the banknote state |x j , results in 0 probability of an outcome since the banknote state always outputs a correct outcome. However, we use the fact that p ef,inc V er1 = 0 for any η x j different from |x j x j |, and further this probability relates to how far these two states are in the metric of fidelity.
Over all the tuples in T n , the probability that Ver1 obtains an incorrect outcome is, (e,f )∈Tn where F x j = x j | η x j |x j = 1 n n e,f (−1) x j,e ⊕x j,f A ef is the square of fidelity between the adversary's state η x j and the banknote state |x j . For simplicity we refer to this squared fidelity as fidelity.
The above probability is calculated for a specific string x j . Since the adversary does not know this string, she instead holds a state which is a mixture of all possible 2 n strings x j . Thus the averaged out error probability for Ver1 is, where F = 1 2 n x j F x j . Similar analysis for Ver2, who receives the mixed state τ x j , the fidelity with the honest note state is G x j = x j | τ x j |x j . The average error probability of obtaining an incorrect outcome is p inc V er2 = 1 2 (1 − G), where G = 1 2 n x j G x j . We cast the objective problem for the adversary to minimize the average error probability of Ver1 and Ver2, This minimization problem can be cast as a semi-definite program (SDP) with the objective to find a lower bound of Eq 32. This can alternatively be viewed as maximizing the average fidelityF = F +G 2 . The security proof in quantum money proposal by Amiri et al. [AA17] has a similar reduction of the average error probability to maximizing the average fidelity of the states received by the two verifiers, Ver1 and Ver2, with the original banknote state. Thus one is interested in finding the completely-positive trace-preserving physical channel that takes a valid banknote state and prepares one copies for Ver1 and Ver2 with maximal average fidelity. Translating this problem in an SDP formalism requires using the Choi-Jamiolkowski representation [Jam72] that translates the channel into a corresponding state in a higher dimension using maximally entangled state |ψ = n i=1 |1 i |1 i . Here we directly use the SDP result of [AA17]. Further details on this SDP construction can be found directly in their work. They numerically verified that for n 14,F This implies that the average fidelity of the states received by Ver1 and Ver2 with the banknote state is upper bounded by a factor less than 1 for n 4. Further, the upper bound on average fidelity decreases with increasing n and if Eq 33 is true for any n (conjectured by [AA17]), then for n 4, any optimal strategy by the adversary results in average fidelity that is upper bounded by 0.5. Eq 33 allows us to give a lower bound on the average probability that Ver1 and Ver2 obtains an incorrect outcome of a tuple in T n , This is the probability for a single copy j chosen by the verifier. Across each of the chosen L uniformly random copies, the average error probability is lower bounded by Eq. 34 in the collective adversary attack scenario. Since the above equation gives us a lower bound on the average error probability for both verifiers, this implies that the minimum error probability e min for any one of the two verifiers, lets say Ver1, must definitely be, The above error probability has been calculated for q = q − (3T − 4)|L| copies. Over the remaining q − q = (3T − 4)|L| copies, we assume that the adversary has full information of the state. Hence the error probability in obtaining the parity outcome of a tuple for the q − q copies is 0 for Ver1 (same for Ver2). The minimum error probability for Ver1 averaged across the l succ copies (where single clicks have been obtained across two distinct modes) is, where the denominator q − (T − 1)|L| is due the fact that the adversary can set (T − 1)|L| positions in the r register to 1, thus effectively ensuring that Ver1 does not select the note copies in those positions. Suppose T |L| = λq, for some small fraction λ < 1 (for example 1/1000), then Eq.(36) is, e min ≈ 997 999 We know that if the holder is honest, the probability of him obtaining the correct parity outcomes across all the l succ copies is c = 1. From Eq. 37, we see that the corresponding probability of obtaining correct parity outcomes for the adversary is upper bounded by c adv = 1 − e min . The gap c − c adv is defined as the noise tolerance of our protocol since it denotes the maximum theoretical probability that an honest noteholder returns an incorrect outcome while still maintaining a non-negative gap in the success probability with any strategy by the adversary. Denoting the cut-off δ = (c−c adv )/2 and using the Chernoff-Hoeffding bound [Yao83], we can now compute the probability that adversary's note passes the test of Verification Phase by both Ver1 and Ver2 is, The condition c > c adv always holds as long as n > 2, hence the probability that both verifiers pass the verification test is exponentially low. Since the Eq. 33 has been verified until n = 14, the maximum noise tolerance of the scheme is up to 21.4%. Further, if Eq. 33 is true for all n, the the maximum noise asymptotic noise tolerance of 25% can be achieved with our scheme.

Coherent attack:
The collective attack strategy focuses on the optimal manipulation of individual copies of the note state. However, the adversary can perform a combined operation on all the copies of the input of state to potentially decrease the average error probability on each copy of the note state lower than the bound Eq. 34. Alternatively, the adversary can hope for a general entangled strategy on the T chosen copies of the verifiers such that conditional on the measurement outcomes obtained in the first T − 1 copies, the value of average error probability for the last copy is decreased even below the bound of Eq. 34. To mitigate any such strategy, we use the results of Croke and Kent [CK12] which proves the security of a quantum relativistic bit commitment protocol against any adversary. Their reduction of a coherent attack strategy to a collective strategy uses the teleportation based argument to show that any error probability achieved via coherent strategy can also be achieved by individual manipulation of the states by an adversary who uses a maximally mixed entangled state to teleport the original state to the verifier (along with the teleportation correction). Also since the collective attack is optimal manipulation of individual states, hence it also includes teleportation based strategies. Our setting is very similar to their construction and allows us to use their results in a straightforward manner. Therefore, any coherent strategy cannot beat the lower bounds proved in the collective strategy.
4. Measure and Resend attack: Till now we have analysed a generic way to upper bound the success probability in any adversary attack scenario. To gain intuition on how an adversary attack would play out, we consider a specific example attack called 'measure and resend'. Here for simplicity, we consider that the adversary does not perform register manipulation or adaptive attack, but rather she simply measures each copy of the incoming state and creates two states based on the measurement outcome to be sent to Ver1 and Ver2.
Assume that the Bank sends a note with q = 10 6 copies of single-photon states to the holder. Each copy is encoded with Bank's secret string x j ∈ {0, 1} 4 for j ∈ [10 6 ]. For verification, |L| = 10 3 copies of the note states are chosen at random and Sampling Matching scheme is performed on each of the copies to obtain a parity measurement outcome.
Suppose the strategy by an adversary is to measure each banknote copy |x j in the basis, With this strategy, Bob can always provide the correct parity outcome either the tuple {1, 2} or {3, 4}. This is because the outcome 1 √ 2 (|1 1 + |1 2 ) only occurs if x j,1 ⊕ x j,2 = 0, while 1 √ 2 (|1 1 − |1 2 ) only occurs if x j,1 ⊕ x j,2 = 1. Similarly the outcomes 1 √ 2 (|1 3 ± |1 4 ) provide a prarity outcome for the tuple {3, 4}. Note that since the state |x j contains log 2 n qubits/bits of information, any strategy by the adversary would limit her information retrieval to only log 2 n bits. This is a consequence of the Holevo's bound [Hol73] which states that it is impossible to retrieve more than log 2 n bits of information from a state of the form |x j . Thus the adversary cannot retrieve the entire information of the secret string x j and hence she cannot forge the note perfectly.
Using the above strategy, the adversary gets the parity information of exactly one tuple. In the resend phase to Ver1 and Ver2, he correctly encodes that parity information, while for the rest bits of which he has no information, he randomly encodes them in 0 or 1. As an example, for the j-th copy, if the adversary get the information of the tuple {1, 2}, the state she sends to both verifiers Ver1 and Ver2 is where he picks r 1 , r 2 such that r 1 ⊕r 2 = x j,1 ⊕x j,2 , and r 3 , r 4 are picked at random from 0/1. Upon receiving the note, Ver1 (similarly Ver2) runs the Sampling Matching scheme with his local |β = 1 2 4 i=1 |1 i on the randomly chosen 10 3 copies of the note state. From Eq.13 and 27, we see that across p 2 ×10 3 = 250 copies, Ver1 will receive 2 photon clicks in the same mode on average thus not obtaining the parity information of any tuple. Across the remaining 750 copies on average, he receives the parity outcome for any one of the three tuples {{1, 2}, {1, 3}, {2, 3}} with equal probability. Since the adversary managed to successfully extract only a single parity outcome, so the probability that the parity outcome obtained by Ver1 is wrong would be, since the adversary will be correct in one parity outcome and the random guessing for remaining two parity outcomes gives him a success rate of 0.5. Thus the sucess probability of the adversary on each copy is c adv = 2/3. If the noteholder was honest, this success probability c = 1 since the banknote was not tampered with. Denoting the cut-off δ = (c − c adv )/2 = 1/6 and using Chernoff-Hoeffding bound, the probability that adversary's note passes the test of Verification phase (whene Ver1 communicates the parity outcome to the Bank) is, Thus we see that it is virtually impossible for an adversary to forge the note with this message and resend attack.

Quantum Money Scheme with Coherent states
In this section, we briefly describe the private quantum money scheme when the Bank encodes secret strings into weak coherent states instead of the single-photon states. The primary reason we want to encode the note as coherent states is that it facilitates the implementation of Sampling Matching in a much simpler and elegant manner. With coherent states, as shown by Kumar et al. [KKD19], the Sampling Matching implementation requires a single 50/50 beam splitter and two single-photon threshold detectors irrespective of input size of the strings.
In the coherent state encoding, the Bank independently and randomly chooses q n-bit binary strings x 1 , x 2 , .., x q ∈ {0, 1} n . Each string x j is now encoded into the coherent state α x j , with an average photon number 1, where x j,k is the k th bit value of string x j . The coherent state α x j is a sequence of n coherent pulses in n modes. The banknote is then the sequence of q coherent states, This is then distributed among the untrusted noteholders. To carry out a transaction, the holders send the note to the local verifiers. The verifier uniformly and randomly selects few copies of the note state to run the Sampling Matching scheme. In this scheme, for each selected copy α x j , the verifier prepares his local state |β = n k=1 1 √ n k as a sequence of n coherent pulses. This state is sequentially interacted with the selected states of the note chosen by the verifier. The interaction is via the 50/50 beam splitter. The coherent pulse modes at the input of verifier's beam splitter in k-th step are, and the output modes are, The output modes are fed into the single-photon threshold detectors D 0 and D 1 to observe the clicks. When a coherent state |α is incident on the threshold detector, the probability of the click is given by, Figure 7 is a depiction of the sequential interaction of the coherent pulses of one copy of an honest noteholder and the verifier's local state.
Let us see how the verifier obtains the parity outcomes of one of the tuples in T n from the detector clicks. The output state in Eq.(46) denotes that the detector D 0 clicks iff x k = 0 while D 1 clicks iff x k = 1. For each of the chosen copy j, the verifier will be unable to infer the parity outcome of any matching with certainty if he does not obtain single-click in atleast two time steps. This probability P(no two single-clicks) = P(no single-clicks) + P(exactly one single-click). We denote this probability by p ¬11 , where p 1 = 1 − exp − 2 n is the probability of observing a single click in one time step. Thus with probability 1 − p ¬11 , which grows with n, the verifier obtains two single-photon clicks in the chosen state. Now suppose the verifier observes single-photon clicks in the k-th and l-th time modes in detectors D 0 and D 1 respectively. This implies d = x k ⊕ x l = 1. This enables the verifier to output the parity outcome of (k, l) ∈ T n . If on the other hand, the verifier does not obtain exactly two clicks in two different time modes, he outputs the parity outcome d = ∅. Figure 7: Sampling Matching (SM) circuit implementation using weak coherent states, 50/50 beam splitter (BS) and single-photon threshold detectors. The upper arm illustrates an honest holder's state as a coherent state |α x , which consists of a sequence of coherent pulses. The coherent state is encoded with a random phase x ∈ {0, 1} n through the phase modulator (PM). The lower arm is used by the verifier to produce a local reference coherent state |β , consisting of a sequence of coherent pulses, with an average photon number of 1. The verifier interferes the states into the 50/50 BS and infers the parity information from the detector clicks in D 0 and D 1 . This allows him to obtain the parity outcome of a tuple in T n . The red dot in the 1 st and 3 rd time sequence denotes that the verifier observed clicks at D 1 and D 0 detectors respectively for these time steps. Thus he infers the parity outcome for the tuple (1, 3), x 1 ⊕ x 3 = 1.

Description of the Money Scheme
We divide our quantum money scheme using coherent states into two phases. First is the Note preparation phase, where the Bank chooses multiple n-bit binary strings independently and randomly. The Bank takes each of these individual strings to produce weak coherent states. The quantum note $ of the Bank is the combined tensor product of coherent states corresponding to all the input strings. This is distributed among the untrusted holders. In the Verification phase, a noteholder sends the note to the verifier in order to carry out a transaction. Upon receiving the note, the verifier randomly selects some copies of the note state (here the note consists of multiple copies, where one copy corresponds to the coherent state that encodes one n-bit string). For the selected copies, he runs the verification protocol using the Sampling Matching, SM scheme (Figure 7). He locally checks if the statistics of the measurement outcome obtained by running the SM-scheme is what he should expect from an honest noteholder. If he finds discrepancies, the note is rejected. If the note passes this test, then the outcomes from the SM-scheme are classically communicated with the Bank. The Bank compares these outcomes with his private n-bit strings. If a high fraction of the outcomes is correct, he outputs the bit Ver B H = 1 implying that the note is valid. Otherwise, he outputs Ver B H = 0.

Note Preparation Phase
1. The Bank independently and randomly chooses q n-bit binary strings x 1 , x 2 , .., x q ∈ {0, 1} n 2. The Bank encodes each the binary string x j into the phase randomized coherent state α x j , with an average photon number 1, where x j,k is the k th bit value of string x j . The coherent state α x j is a sequence of n coherent Figure 8: Illustration of our quantum money scheme based on the verification protocol using the SMscheme. In the Note Preparation phase, the Bank independently and randomly selects q n-bit binary strings and produces note coherent states $ = |α x 1 ⊗ |α x 2 ⊗ · · · ⊗ α xq . The Bank initializes the r register to keep a track of the number of positions in [q] where the states have been used for verification and the count register to keep track of the number of verification attempts on the note. The note ($, r) is then sent to the holder. To carry out a transaction, the holder sends the note to an honest verifier of the Bank. In the Verification phase, the verifier selects a fraction of the q copies of the note state with positions 0 in the r register. He creates his local state |β j and applies the SM-scheme on those selected copies. If the note passes the local test of the verifier, he sends the measurement outcomes of the test to the Bank. Finally, the Bank compares the outcomes with his secret string x j 's and outputs a bit Ver B H stating whether the note is valid or not. pulses in n modes. The note is a combination of all the q copies of the coherent state $ = |α x 1 ⊗ |α x 2 ⊗ · · · ⊗ α xq .
3. The Bank creates a classical binary register r and initializes it to 0 q . This register keeps the track of positions j where the states have been used for the verification.
4. The Bank creates a counter variable count and initializes it to 0. This keeps a track of the number of verification attempts.
5. The Bank sends the quantum note ($, r) to the holder.

Discussion
We have introduced the private quantum money scheme as a cryptographic task using the Sampling Matching verification scheme. Sampling Matching is an experimentally motivated verification framework to ease out the implementation of quantum money schemes. Our proposed money scheme demonstrates an information-theoretic security against any adversary with a noise tolerance of 21.4%. We mostly focus on the scheme with the banknotes being single-photon states. This has been done keeping in mind that singlephoton states are a direct realisation of qubit/qudit with linear optics, thus our money scheme definition can be directly translatable to other qubit encoding pictures. The security analysis of our money scheme considers the most general attack by the adversary trying to duplicate the banknotes which can be passed by the Bank with high probability. In the second half, we have proposed a money scheme to encode the secret strings into a sequence of coherent states with the verification using Sampling Matching consisting of a single 50/50 beam splitter and 2 single-photon threshold detectors. This scheme provides a dramatic reduction in the component requirements by the verifier thus experimentally facilitate achieving higher noise tolerance than what is realistically feasible with other quantum money schemes. Another major challenge in quantum money schemes is the storage of quantum states of the Bank in a quantum memory which can then be distributed to the holder. There has been considerable ongoing works in the development of quantum memory for storing and retrieving the quantum data [LST09, JSC + 04, FL02,KMP00]. Even though this is not the specific focus of our work as our approach is to simplify the verifier's circuit, we still address the above memory issue partially by introducing the verifier circuit (when the banknotes are encoded coherent states) that works even when the states are sent on the fly i.e. no memory is required by the verifier to store them. This is due to the fact that the coherent state encoding is a tensor product of individual coherent pulses and the beam splitter interaction with the verifier's state occurs separately on each of these pulses.
Finally, the verification tool using Sampling Matching is a generic tool that has the potential to be applied to other cryptographic tasks such as key-distribution, and also in quantum verification protocols such as efficient verification of prover's state with limited verifier resources in scenarios where the prover does not want to fully reveal the secret encoding [ADK18]. Since most cryptographic schemes rely on one-way functions and the fact that it is hard for an adversary to invert the function without having the knowledge of the secret key that was used to prepare the function, the scheme using Sampling Matching offers an excellent candidate to be such an experimentally realisable function.